Anmol loves to hack computers. Today he is trying to hack Rishabh Tiwary's computer. As he is a pro hacker, he found the encrypted form of the password as a number n and the process to decrypt it.

The password can be decrypted by following steps:-

\(Step 1:-\) Make a set x of divisors of n (other than 1) which are \( \le \sqrt{n}\).

\(Step 2:-\) Calculate p, such that p \(=\) number of subsets of set x such that sum of all elements of subset has at least 1 divisor in set x.

Number p is password of Tiwary's computer as Anmol is weak in mathematics he is asking for your help. Can you help him?

Input

A single integer n

Output

A single integer p password of Tiwary's computer

Constraints

\( 1 \le n \le 2500 \)