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 that n 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 ≤ 1018)
— the prediction on the number of people who will buy the game.

Output

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

Examples

input

3000

output

1

求从1到n有多少个数可以被从2到10的数整除，最小公倍数

#include <iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<queue>
#include<stack>
#include<vector>
#include<algorithm>
using namespace std;

int main()
{
long long n,sum;
while(~scanf("%I64d",&n))
{
printf("%I64d\n",n/2520);
}
return 0;
}