跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F2561. Almost Prime

  • ID: 2567
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:入门
  • 上传者:
  • 数论
  • 数学
  • 入门
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

Almost Prime

题目描述

A. Almost Prime
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

A number is called almost prime if it has exactly two distinct prime divisors. For example, numbers 6, 18, 24 are almost prime, while 4, 8, 9, 42 are not. Find the amount of almost prime numbers which are between 1 and n, inclusive.

Input

Input contains one integer number n (1≤n≤3000).

Output

Output the amount of almost prime numbers between 1 and n, inclusive.

Examples
Input
10
Output
2
Input
21
Output
8

题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 2208 题。保留原作者与原赛事署名。