Prime_triangle

import java.util.ArrayList;
import java.util.Scanner;

public class Prime_Triangle {
    public static void main(String[] args) {
        Scanner sc=new Scanner(System.in);
        int count=sc.nextInt();
        int counter=1;
        ArrayList<Integer> primeList=new ArrayList<Integer>();

        for (int i=1;i<=count;i++)
        {
            for (int j=1;j<=i;j++)
            {
                if(i%j==0)
                {
                    counter++;
                }
                if (counter>2)
                {
                    counter=0;
                    break;
                }
            }
            if (counter==2)
            {
                primeList.add(i);
            }
            counter=0;
        }
        for (int i=1;i<=primeList.size();i++)
        {

            for (int j = 1; j <= primeList.get(i-1); j++)
            {
                    if(j>3 && j%2==0 ||j>8 && j%3==0 || j>8 && j%5==0 || j>8 && j%7==0 )
                    {
                        System.out.print("0");
                    }
                    else {
                        System.out.print("1");
                    }
            }
            System.out.println();


        }
    }
}