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 {

    static List<Long> divisor(long n) {
        List<Long> list = new ArrayList<Long>();
        for (long i=1;i<=Math.sqrt(n);i++) {
            if (n%i==0) {
                list.add((long)i);
                if (i*i!=n) {
                    list.add(n/i);
                }
            }
        }
        Collections.sort(list);
        return list;
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long N = sc.nextLong();
        ArrayList<Long> list_2 = new ArrayList<Long>(divisor(N));
        int ans = 0;
        for (int i=0;i<list_2.size();i++) {
            long tmp = N;
            if (list_2.get(i)==1) continue;

            while (tmp%list_2.get(i)==0) {
                tmp = tmp/list_2.get(i);
            }
            if (tmp%list_2.get(i)==1) ans++;
        }
        ArrayList<Long> list = new ArrayList<Long>(divisor(N-1));
        System.out.println(ans+list.size()-1);
    }
}