codeforces630K(容斥原理)

K. Indivisibility

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 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 ≤ 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 not divisible by any number from 2 to 10.

Examples

input

12

output

2

AC代码：

//codeforces-630K(容斥原理)
//题目大意:给你一个数n,问1~n中不能被2~10中任意一个数整除的数的个数？
//解题思路:由于能整除4、6、8的一定能被2整除，同理能整除6，9的一定能整除3，整除10的
//能被5整除，所以只需判断不能被2，3，5，7整除的个数即可，然后直接用容斥原理求得结果 。 
#include<cstdio>
int main()
{
	__int64 n,result;
	scanf("%I64d",&n);
	result=n-(n/2+n/3+n/5+n/7)+(n/6+n/10+n/14+n/15+n/21+n/35)-(n/30+n/42+n/70+n/105)+n/210;
	printf("%I64d\n",result);
	return 0;
}