Codeforces Round #465 (Div. 2) A. Fafa and his Company

A. Fafa and his Company

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 ≤ 105) — the number of employees in Fafa's company.

Output

Print a single integer representing the answer to the problem.

Examples

input

Copy

2

output

1

input

Copy

10

output

3

题意：给你n个人，选出l个领导，这l个领导分别管理剩余的人，而且每个领导所管理的人数必须相同，问你有几种选领导的方式。

思路：直接暴力，从1到n-1判断一遍即可，对于每个领导数l，如果(n-l)%l==0此时成立。

#include
#define ll long long
using namespace std;
ll n,ans;
int main()
{
    while(~scanf("%lld",&n))
    {
        ans=0;
        for(ll i=1;i