CF630J.Divisibility

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.

IT City 公司在开发电脑游戏时，发明了一种奖励员工的新方式。每当一款新游戏发布后，用户便开始积极购买，而公司会精确追踪每一笔交易的销量数据。每当销量总数恰好能被 $2$ 到 $10$ 之间的所有整数整除时，该款游戏的每位开发者都会获得一笔小额奖金。

游戏设计师小彼得（Petya）得知，公司即将发布一款新游戏，而他本人也参与了该游戏的部分开发工作。基于以往经验，他预测该游戏在首月将售出 $n$ 份。现在，小彼得希望知道自己将获得多少次奖金。请帮助他计算这一数值。

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.

输入仅包含一行，其中有一个整数 $n$（$1 ≤ n ≤ 10^{18}$）—— 表示预测的购买该游戏的人数。

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

输出一个整数，表示从 1 到 $n$ 中有多少个数能被 2 到 10 的所有数整除。