Limits
1s, 512 MB
Byang is going to join a new school. His new class has N students.
Each of the students are identified by their roll numbers starting from 1 to N. Byang’s roll number will be N.
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 N (0<N<1000000).
Output
Print the number of friends Byang will make in his new class.
Sample
Input | Output |
---|
6 | 3 |
Factors
| CPU | Memory | Source |
---|
Bash 5.2 | 1× | 1× | 1× |
Brainf*ck | 1× | 1× | 1× |
C# Mono 6.0 | 1× | 1× | 1× |
C++17 GCC 13.2 | 1× | 1× | 1× |
C++20 Clang 16.0 | 1× | 1× | 1× |
C++20 GCC 13.2 | 1× | 1× | 1× |
C++23 GCC 13.2 | 1× | 1× | 1× |
C11 GCC 13.2 | 1× | 1× | 1× |
C17 GCC 13.2 | 1× | 1× | 1× |
C23 GCC 13.2 | 1× | 1× | 1× |
Common Lisp SBCL 2.0 | 1× | 1× | 1× |
D8 11.8 | 1× | 1× | 1× |
Erlang 22.3 | 1× | 1× | 1× |
Free Pascal 3.0 | 1× | 1× | 1× |
Go 1.22 | 1× | 1× | 1× |
Grep 3.7 | 1× | 1× | 1× |
Haskell 8.6 | 1× | 1× | 1× |
Java 1.8 | 1× | 1× | 1× |
Kotlin 1.9 | 1× | 1× | 1× |
Kotlin 2.0 | 1× | 1× | 1× |
Lua 5.4 | 1× | 1× | 1× |
Node.js 10.16 | 1× | 1× | 1× |
Perl 5.30 | 1× | 1× | 1× |
PHP 8.3 | 1× | 1× | 1× |
PyPy 7.3 (3.10) | 1× | 1× | 1× |
Python 3.12 | 1× | 1× | 1× |
Ruby 3.2 | 1× | 1× | 1× |
Rust 1.57 | 1× | 1× | 1× |
Swift 5.3 | 1× | 1× | 1× |
Whitespace | 1× | 1× | 1× |