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) throws Exception {
        Scanner sc = new Scanner(System.in);
        long n = sc.nextLong();
        if(n == 2){
            System.out.println(1);
            return;
        }
        long ans = calc_n1(n-1);
        ans += calc_n0(n);
        System.out.println(ans);
    }
    
    public static long calc_n1(long l){
        long max = (long)Math.pow(l,0.5)+1;
        long ret = 1;
        for(long i = 2; i < max; i++){
            if(l % i == 0){
                ret += (l / i == i) ? 1 : 2;
            }
        }
        return ret;
    }
    
    public static long calc_n0(long l){
        long max = (long)Math.pow(l,0.5)+1;
        long ret = 1;
        for(long i = 2; i < max; i++){
            long l2 = l;
            boolean div = false;
            while(l2 % i == 0){
                l2 /= i;
                div = true;
            }
            if(l2 % i == 1 && div){
                ret++;
            }
        }
        return ret;
    }
}