CodeForces 630J-Divisibility【最小公倍数】

J. Divisibility

time limit per test

0.5 seconds

memory limit per test

64 megabytes

input

standard input

output

standard output

IT City company developing computer games invented a new way to reward its employees. After a new game release users start buying it actively, and the company tracks the number of sales with precision to each transaction. Every time when the next number of sales is divisible by all numbers from 2 to 10 every developer of this game gets a small bonus.

A game designer Petya knows that the company is just about to release a new game that was partly developed by him. On the basis of his experience he predicts thatn people will buy the game during the first month. Now Petya wants to determine how many times he will get the bonus. Help him to know it.

Input

The only line of the input contains one integer n (1 ≤ n ≤ 10¹⁸) — the prediction on the number of people who will buy the game.

Output

Output one integer showing how many numbers from 1 ton are divisible by all numbers from2 to 10.

Examples

Input

3000

Output

1

解题思路：

	就是找到2-10的最小公倍数，看看1-n中有多少能被2520整除。

<pre name="code" class="cpp">#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int main()
{
	__int64 a;
	while(scanf("%I64d",&a)!=EOF)
	{
		printf("%I64d",a/2520);
	}
	return 0;
}