CodeForces 630K： Indivisibility【容斥】

 Indivisibility

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

Submit  Status

Description

IT City company developing computer games decided to upgrade its way to reward its employees. Now it looks the following way. 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 not divisible by any number 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 not divisible by any number from 2 to 10.

Sample Input

Input

12

Output

2

思路：先求出所有能被2到10中任一个数整除的数，即2，3，5，7的倍数，根据容斥原理，一个因子的所有倍数减去两个因子的所有倍数加上三个因子的所有倍数减去四个因子的所有倍数。

AC-code：

#include<cstdio>
#include<cstring>
using namespace std;
int main()
{
	long long n,m;
	scanf("%lld",&n);
	m=n/2+n/3+n/5+n/7-n/6-n/10-n/14-n/15-n/21-n/35+n/30+n/105+n/70+n/42-n/210;
	m=n-m;
	printf("%lld\n",m);	
}