C

Problem description

Fafa owns a company that works on huge projects. There are n employees in Fafa's company. Whenever the company has a new project to start working on, Fafa has to divide the tasks of this project among all the employees.

Fafa finds doing this every time is very tiring for him. So, he decided to choose the best l employees in his company as team leaders. Whenever there is a new project, Fafa will divide the tasks among only the team leaders and each team leader will be responsible of some positive number of employees to give them the tasks. To make this process fair for the team leaders, each one of them should be responsible for the same number of employees. Moreover, every employee, who is not a team leader, has to be under the responsibility of exactly one team leader, and no team leader is responsible for another team leader.

Given the number of employees n, find in how many ways Fafa could choose the number of team leaders l in such a way that it is possible to divide employees between them evenly.

Input

The input consists of a single line containing a positive integer n (2 ≤ n ≤ 10⁵) — the number of employees in Fafa's company.

Output

Print a single integer representing the answer to the problem.

Examples

Input

2

Output

1

Input

10

Output

3

Note

In the second sample Fafa has 3 ways:

• choose only 1 employee as a team leader with 9 employees under his responsibility.
• choose 2 employees as team leaders with 4 employees under the responsibility of each of them.
• choose 5 employees as team leaders with 1 employee under the responsibility of each of them.

解题思路：结合提示，再多举几个栗子，将会发现问题求解其实是求n的因子个数（不包括n），水过！

AC代码：

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int n;
    cin>>n;
    int num=1;
    for(int i=2;i<=n/2;++i)
        if(n%i==0)num++;
    cout<<num<<endl;
    return 0;
}