You cannot submit for this problem because the contest is ended. You can click "Open in Problem Set" to view this problem in normal mode.

Time Limit: 2.0 s

Memory Limit: 256.0 MB

Description

Pritom the CR of from 60th batch E section is a generous person. He believes in equality. On his birthday, he wants to distribute chocolates to his friends. He wants to distribute chocolates in such way that, each of his friends get equal number of chocolates.

Pritom has \(N\) number of chocolates. Find how many ways Pritom can distribute chocolates to his friends such that each of them gets equal number of chocolates.
for example : if he has 4 cnadies he can distribute them as follows:

• give one candies to each of 4 friends
• or, give two candies to each of 2 friends
• or give 4 candies to one friend

so he can distribute 4 candies in 3 different ways.

Input

Only line takes an integer \(N\) : number of candies
1 <= \(N\) <= 10^6

Output

print an integer : The number of ways Pritom can distribute all candies

Sample 1

input

4

output

3

Sample 2

input

6

output

4

Pritom can distribute 6 candies to 1,6,2,3 friends evenly.