The New Year
Limits: 2 sec., 256 MiB
The New Year is probably the most exciting and pleasant holiday in the year. Kids are waiting for the presents and it is well known that Did Moroz is the one to bring them.
Did Moroz has many different names. For example, in Turkey he is Noel Baba, in America — Santa Claus, in Finland — Joulupukki and in Italy his name is Babbo Natale.
During the year Did Moroz is preparing for the New Year night. Sometimes he has one day more for the preparation. This happens during the leap year. As you know a year is considered to be leap if it is divisible by 400 or if it is divisible by 4 and not divisible by 100.
Some time ago Did Moroz decided to calculate the number of leap years among the next \(N\) years. But he is quite an old guy and thus does not remember either when he has decided to calculate that or what the answer was. Your task is to find the minimal and maximal possible Did Moroz’s answers.
Input
The only integer number \(N\).
Output
Two integer numbers separated by a single space — the minimal and maximal possible Did Moroz’s answers.
Constraints
\(1 \le N \le 1000000000 (10^9)\).
Samples
| Input (stdin) | Output (stdout) |
|---|---|
| 7 | 0 2 |
Notes
For example, from 1897 till 1903, inclusive, there was no leap year and from 2002 till 2008, inclusive, there were two of them.
Submit a solution
| Element Type | Created | Who | Problem | Compiler | Result | Time (sec.) | Memory (MiB) | # | Actions |
|---|
| Element Type | Created | Who | Problem | Compiler | Result | Time (sec.) | Memory (MiB) | # | Actions |
|---|