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.math.BigInteger;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;
import java.util.Scanner;
import java.util.Set;

public class Main {
	public static void main(String[] args) throws Exception {
		Scanner sc = new Scanner(System.in);
		long n = sc.nextLong();
		sc.close();

		Set<Long> set = new HashSet<>();
		BigInteger bn = BigInteger.valueOf(n);
		for (long j = 2; j * j <= n; j++) {
			for (int i = 1; i <= 40; i++) {
				BigInteger bj = BigInteger.valueOf(j).pow(i);
				if (bj.compareTo(bn) <= 0) {
					if (bn.mod(bj).compareTo(BigInteger.ZERO) == 0) {
						long t = bn.divide(bj).longValueExact() - 1;
						if (t % j == 0) {
							set.add(j);
							break;
						}
					}
				} else {
					break;
				}
			}
		}
		List<Long> list2 = divList(n - 1);
		set.addAll(list2);
		set.add(n);

		long s = (long) Math.sqrt(n);
		s -= 5;
		List<Long> list3 = divList(n);
		for (long l : list3) {
			if (l >= s) {
				long t = n / l - 1;
				if (t % l == 0) {
					set.add(l);
				}
			}
		}

		set.remove(1L);
		System.out.println(set.size());
	}

	static List<Long> divList(long n) {
		List<Long> list = new ArrayList<>();
		long end = (long) Math.sqrt(n);
		for (int i = 1; i <= end; i++) {
			if (n % i == 0) {
				list.add((long) i);
			}
		}
		int i = end * end == n ? list.size() - 2 : list.size() - 1;
		for ( ; i >= 0; i--) {
			list.add(n / list.get(i));
		}
		return list;
	}
}
