Constructions
van Petrovich teaches physical education at school, but also interested in mathematics, mainly from a practical point of view. For example, he wondered how many different theories exist for the group of Npeople. Ivan Petrovich found that if N – a prime number, we get only 2 building: in column one (1×N) and rank (N×1). These trivial construction is possible for any N > 1 (for N = 1, there is only one building a1×1, which is neither a rank nor a colony). If N – a composite number, then there are other non-trivial construction. For 100 people, there are nine constructs: 1×100, 2×50, 4×25, 5×20, 10×10, 20×5, 25×4, 50×2 and 100×1.
Write a program that finds the number of different constructions for the group of N people.
Input
In the first line of input contains one integer N (1 ≤ N ≤ 10^9).
Output
Output one integer - the number of different constructions for the group of N people.