Prime Triangle

import java.util.Scanner;

public class PrimeTriangle {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = Integer.parseInt(scanner.nextLine());
        StringBuilder stringBuilder = new StringBuilder();

        for (int i = 1; i <= n; i++) {
            if (isPrime(i)) {
                stringBuilder.append("1");
                System.out.println(stringBuilder);

            } else {
                stringBuilder.append("0");
            }
        }
    }

    static boolean isPrime(int i) {
        int divider = 2;
        int maxDivider = (int) Math.sqrt(i);
        boolean prime = true;
        while (prime && (divider <= maxDivider)) {
            if (i % divider == 0) {
                prime = false;
            }
            divider++;
        }
        return prime;
    }
}