Given is a positive integer N.

We will choose an integer K between 2 and N (inclusive), then we will repeat the operation below until N becomes less than K.

* Operation: if K divides N, replace N with N/K; otherwise, replace N with N-K.



In how many choices of K will N become 1 in the end?

Constraints

* 2 \leq N \leq 10^{12}
* N is an integer.

Input

Input is given from Standard Input in the following format:


N


Output

Print the number of choices of K in which N becomes 1 in the end.

Examples

Input

6


Output

3


Input

3141


Output

13


Input

314159265358


Output

9
import java.util.*;
public class Main {
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		long a = sc.nextLong()-1;		
        long c = 0;
        for(long i=2;i<=Math.sqrt(a);i++){if(a%i==0){c+=2;}if(i==Math.sqrt(a)){c--;}
                                         }
        if(a>=2){c++;}
        a++; 
        long e,f,g;
        for(long i=2;i<=Math.sqrt(a);i++){
          if(a%i==0){
          if(i<Math.sqrt(a)){g=a;e=i;f=a/i;                                                              
                             while(g%e==0){g/=e;}                                                                     
                             if(g%e==1){c++;}                                                                     
                             g=a;
                             while(g%f==0){g/=f;}                                                                  
                             if(g%f==1){c++;}                                                                  
                            }
                              else{c++;}                                                                          
                    }                                        
        }
        c++;
        System.out.println(c);                                  
	}
}
