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.Scanner;

public class Main {
    public static boolean isOk(long n, long k) {
        while (n % k == 0) {
            n = n / k;
        }
        return n % k == 1;
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long n = sc.nextLong();
        // nがkで割り切れるとき
        int ans = 1;  // n = k の場合のぶん
        for (long k = 2; k * k <= n; k++) {
            if(n % k == 0){
                if (isOk(n, k)) {
                    ans++;
                }
                // n/kもnの約数なので同時に計算
                if (n/k != k && isOk(n, n/k)){
                    ans++;
                }
            }
        }
        // nがkでわり切れない時
        if (n > 2){
            ans++;  // k = n - 1の場合のぶん
            for (long k = 2; k * k <= n-1; k++) {
                if ((n - 1) % k == 0) {
                    ans ++;
                    // (n-1)/kもn-1の約数なので同時に計算
                    if ((n - 1) / k != k){
                        ans++;
                    }
                }
            }
        }
        System.out.println(ans);
    }
}
