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 {
    void run() {
        Scanner sc = new Scanner(System.in);
        long n = sc.nextLong();
        Set<Long> set = new HashSet<>();
        Set<Long> ans = new HashSet<>();

        set.add(n);
        for (long i = 2; i * i <= n; i++) {
            if (n % i == 0) {
                set.add(i);
                set.add(n / i);
            }
        }

        for (long i : set) {
            long nn = n;
            while (nn % i == 0) {
                nn = nn / i;
            }
            if (nn == 1 || (nn - 1) % i == 0) ans.add(i);
        }


        if (n != 2) ans.add(n - 1);
        for (long i = 2; i * i <= n; i++) {
            if ((n - 1) % i == 0) {
                ans.add(i);
                ans.add((n - 1) / i);
            }
        }

        System.out.println(ans.size());

    }

    void debug(Object... os) {
        System.err.println(Arrays.deepToString(os));
    }

    public static void main(String[] args) {
        new Main().run();
    }
}
