Practice on Toph

Participate in exhilarating programming contests, solve unique algorithm and data structure challenges and be a part of an awesome community.

Making Friends

Limits 1s, 512 MB

Byang is going to join a new school. His new class has NN students.

Each of the students are identified by their roll numbers starting from 11 to NN. Byang’s roll number will be NN.

Byang plans to make friends with only those whose roll numbers are a divisor of his roll number.

Can you help Byang count how many friends he could potentially make? You can assume everyone wants to be Byang’s friend.

Input

The input will contain an integer NN (0<N<10000000 < N < 1000000).

Output

Print the number of friends Byang will make in his new class.

Sample

InputOutput
6
3

Discussion

Statistics


96% Solution Ratio

hasanakhiarEarliest, Nov '18

hasanakhiarFastest, 0.0s

HurayraIITLightest, 0 B

n4o847Shortest, 34B

Submit

Login to submit

Toph uses cookies. By continuing you agree to our Cookie Policy.