CodeForces 630J：Divisibility 【数学】

Divisibility

Time Limit:500MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u

Submit  Status

Description

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 ≤ 10¹⁸) — 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.

Sample Input

Input

3000

Output

1

能被2到10内任意一个数整除，则只能是2到10的最小公倍数的整数倍。

AC-code：

#include<cstdio>
int main()
{
	long long n;
	scanf("%lld",&n);
	printf("%lld\n",n/2520);
	return 0;
}