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.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.*;

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

    public void solve() {
        Scanner scan = new Scanner(new BufferedReader(new InputStreamReader(System.in)));
        long N = scan.nextLong();
        Set<Long> divisors = new HashSet<>();
        for (long i = 1; i * i <= N-1; i++) {
            if ((N - 1) % i != 0) {
                continue;
            }
            if (i != 1) {
                divisors.add(i);
            }
            if (1 < (N - 1) / i) {
                divisors.add((N - 1) / i);
            }
        }
        List<Long> list = new ArrayList<>();
        for (long i = 1; i * i <= N; i++) {
            if (N % i != 0) {
                continue;
            }
            if (i != 1) {
                list.add(i);
            }
            if (1 < N / i) {
                list.add(N / i);
            }
        }
        for (long i : list) {
            long target = N;
            while (target % i == 0) {
                target /= i;
            }
            target -= ((target - i) / i) * i;
            while (i <= target) {
                target -= i;
            }
            if (target == 1) {
                divisors.add(i);
            }
        }
        divisors.remove(1);
        System.out.println(divisors.size());
    }
}
