PrimeToN

import java.util.Scanner;

public class PrimeToN {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        int n = scanner.nextInt();


        for (int number = 1; number <= n; number++) {
            int maxDivider = (int) Math.sqrt(number);
            boolean isPrime = true;

            for (int divider = 2; divider <= maxDivider; divider++) {
                if (number % divider == 0) {
                    isPrime = false;
                }
            }
            if (isPrime) {

                System.out.printf("%d ", number);
            }
        }
    }
}