PrimeTriangle

import java.util.Scanner;
public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int[] numbers = new int[N];
        for (int i = 0; i < numbers.length; i++) {
            numbers[i] = i + 1;
        }
        int numb;
        String result = "";

        for (int num : numbers) {
            boolean prime = true;
            int divider = 2;
            int maxDivider = (int) Math.sqrt(num);

            while (divider <= maxDivider) {
                if (num % divider == 0) {
                    prime = false;
                    break;
                }
                divider++;
            }
            if (prime) {
                numb = num;
                result += numb + ",";
            }
        }
        String[] triangle = result.split(",");
        for (String tri : triangle) {
            String finalS = "";
            int parsed = Integer.parseInt(tri);
            for (int j = 1; j <= parsed; j++) {
                boolean prime = true;
                int divider = 2;
                int maxDivider = (int) Math.sqrt(j);

                while (divider <= maxDivider) {
                    if (j % divider == 0) {
                        prime = false;
                        break;
                    }
                    divider++;
                }
                if (prime) {
                    finalS += 1;
                }
                else{finalS+=0;}
            }
            System.out.println(finalS);
        }

    }
}