Birthdays

Program time limit: 1 second

Program memory limit: 512 MB

On her 21st birthday, Penny is dreaming of her future. When Penny turns a certain age $n$, she considers a good age $g$ to be one such that she can split the $n$ candle sticks of her birthday cake into $g$ even groups. For a given age that Penny is turning, determine how many good ages there are. If g is infinite, then output INFINITE.

Input

The first and only line of input contains one integer $n$.

You should read from standard input.

In Python, you could use the line n = int(input()).

In C or C++, you could use the line int n; scanf("%d", &n);.

Constraints

For all test cases:

• $0 \le n \le 1,000,000$ for all $n$.

Output

Output a single integer, $g$, the number of good ages.

You should write to standard output.

In Python, you could use the line print(answer).

In C or C++, you could use the line printf("%d\n", answer);.

Sample Input 1

11

Sample Output 1

2

Explanation 1

The only good ages for Penny turning 11 are 1 and 11 itself.

Sample Input 2

5000

Sample Output 2

20

Explanation 2

This one's up to you!.

Scoring

Your program will be run on the 9 hidden test cases one after another. Your program must pass all 9 test cases to receive the marks for this question. Recall that your final score on the task is the score of your highest scoring submission.

Submit

Past submissions

You haven't submitted to this task.