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 \textbf{N}people. Ivan Petrovich found that if \textbf{N} -- a prime number, we get only \textbf{2} building: in column one (\textbf{1}×\textbf{N}) and rank (\textbf{N}×\textbf{1}). These trivial construction is possible for any \textbf{N}  > \textbf{ 1} (for \textbf{N}  =  \textbf{1}, there is only one building a\textbf{1}×\textbf{1}, which is neither a rank nor a colony). If \textbf{N} -- a composite number, then there are other non-trivial construction. For \textbf{100} people, there are nine constructs: \textbf{1}×\textbf{100}, \textbf{2}×\textbf{50}, \textbf{4}×\textbf{25}, \textbf{5}×\textbf{20}, \textbf{10}×\textbf{10}, \textbf{20}×\textbf{5}, \textbf{25}×\textbf{4}, \textbf{50}×\textbf{2} and \textbf{100}×\textbf{1}. Write a program that finds the number of different constructions for the group of \textbf{N} people. \InputFile In the first line of input contains one integer \textbf{N} (\textbf{1}  ≤ \textit{ }\textbf{N}  ≤  \textbf{10^9}). \OutputFile Output one integer - the number of different constructions for the group of \textbf{N} people.