← Back to Problems

1 and Prime Numbers

1 and Prime Numbers

Given a positive integer N, find all prime numbers less than N. Output them in ascending order, one per line.

Input

A single integer N (1 ≤ N ≤ 100,000,000) read from standard input.

Output

All qualifying numbers less than N, printed one per line in ascending order. If there are no qualifying numbers, output nothing.

Example

Input:

13

Output:

1
2
3
5
7
11

Scoring

Your solution is evaluated against 10 test cases worth 10 points each (100 total). Choose your language and get started.

LEADERBOARD

Rank Developer Score Submitted
1 🥇 meetpatel-D3sTr0
100 / 100
May 15, 2026, 11:27 AM UTC
2 🥈 HetaDobariya
100 / 100
May 15, 2026, 11:33 AM UTC
3 🥉 aniket-axy
100 / 100
May 15, 2026, 11:34 AM UTC
4 harshwadhwani-10
100 / 100
May 15, 2026, 11:37 AM UTC
5 Abhishek0931
100 / 100
May 15, 2026, 11:38 AM UTC
6 shivam
100 / 100
May 15, 2026, 11:39 AM UTC
7 kaustubh
100 / 100
May 15, 2026, 11:49 AM UTC
8 Anujjj12
100 / 100
May 15, 2026, 11:54 AM UTC
9 Abhishek-Envysolo
100 / 100
May 15, 2026, 11:55 AM UTC
10 lokesh
100 / 100
May 15, 2026, 11:58 AM UTC
11 suplerplay21
100 / 100
May 15, 2026, 12:05 PM UTC
12 gAditya2208
100 / 100
May 22, 2026, 11:54 AM UTC
13 mrsuyashkesharwani
0 / 100
May 15, 2026, 12:05 PM UTC