bcsinh

#include<iostream>
#include<cmath>
using namespace std;
void in(int day[],int n){
    for(int i=0; i<n; i++) cout<<day[i];
    cout<<endl;
}
void next(int day[],int n){
    int vitri=n-1;
    while(day[vitri]==1) vitri--;
    day[vitri]=1;
    for(int i=vitri+1; i<n; i++) day[i] = 0;
}
int main(){
    int n;                      //do dai day
    cin>>n;
    int soday=pow(2,n);         //so luong day
    int day[100]={0};           //tao day ban dau
    in(day,n);
    for(int i=1; i<=soday-1; i++){
        next(day,n);
        in(day,n);
    }
    return 0;
}