package com.company;

import java.util.Scanner;

public class PrimeTriangle {

 public static void isPrime(int n) {
     for (int i = 1; i <= n; i++) {
         int divider = 2;
         int maxDivider = (int) Math.sqrt(i);
         boolean isPrime = true;
         while (isPrime && divider <= maxDivider) {
             if (i % divider == 0) {
                 isPrime = false;
             }
             divider++;
         }
         for (int j = 0; j <i ; j++) {
             if(isPrime){
             System.out.print("1");}
             else{
                 System.out.print("0");
             }

         }  System.out.println();

     }
     return ;
 }

    public static void main(String[] args) {
        Scanner userInput = new Scanner(System.in);
       int n=userInput.nextInt();
       isPrime(n);
    }
}