using System;
using System.Collections.Generic;

namespace _3._Prime_Triangle
{
    class Program
    {
        static void Main(string[] args)
        {
            int n = int.Parse(Console.ReadLine());
            int counter = 0;
            List<int> primeNumbers = new List<int>();

            for (int i = 1; i <= n; i++)
            {
                for (int j = 1; j <= i; j++)
                {
                    if (i % j == 0)
                    {
                        counter++;
                    }
                    else
                    {
                        continue;
                    }
                }
                if (counter == 2 || i == 1)
                {
                    primeNumbers.Add(i);
                    for (int k = 1; k <= i; k++)
                    {
                        if (primeNumbers.Contains(k))
                        {
                            Console.Write(1);
                        }
                        else
                        {
                            Console.Write(0);
                        }
                    }
                    Console.WriteLine();
                }
                counter = 0;
            }
        }
    }
}