#include<bits/stdc++.h>
// #define int long long
#define f1(i, n) for(int i=1;i<=n;++i)
#define f0(i, n) for(int i=0;i<n;i++)
#define all(x) x.begin(), x.end()
#define fi first
#define se second
#define pb push_back
#define endl "\n"
#define NAME "countpath"
using namespace std;
const int MAXN = 1e3 + 5;
const int maxRC = 2207;
const int MOD = 998244353;
int n;
int bin[30];
void Try(int i) {
if (i > n) {
for (int j = 1; j <= n; ++j) {
cout << bin[j];
}
cout << endl;
return;
}
bin[i] = 0;
Try(i + 1);
bin[i] = 1;
Try(i + 1);
}
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
if (fopen(NAME".INP", "r")) {
freopen(NAME".INP", "r", stdin);
freopen(NAME".OUT", "w", stdout);
}
cin >> n;
Try(1);
return 0;
}
I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KLy8gI2RlZmluZSBpbnQgbG9uZyBsb25nCiNkZWZpbmUgZjEoaSwgbikgZm9yKGludCBpPTE7aTw9bjsrK2kpCiNkZWZpbmUgZjAoaSwgbikgZm9yKGludCBpPTA7aTxuO2krKykKI2RlZmluZSBhbGwoeCkgeC5iZWdpbigpLCB4LmVuZCgpCiNkZWZpbmUgZmkgZmlyc3QKI2RlZmluZSBzZSBzZWNvbmQKI2RlZmluZSBwYiBwdXNoX2JhY2sKI2RlZmluZSBlbmRsICJcbiIKI2RlZmluZSBOQU1FICJjb3VudHBhdGgiCnVzaW5nIG5hbWVzcGFjZSBzdGQ7Cgpjb25zdCBpbnQgTUFYTiA9IDFlMyArIDU7CmNvbnN0IGludCBtYXhSQyA9IDIyMDc7CmNvbnN0IGludCBNT0QgPSA5OTgyNDQzNTM7CgppbnQgbjsKaW50IGJpblszMF07Cgp2b2lkIFRyeShpbnQgaSkgewogICAgaWYgKGkgPiBuKSB7CiAgICAgICAgZm9yIChpbnQgaiA9IDE7IGogPD0gbjsgKytqKSB7CiAgICAgICAgICAgIGNvdXQgPDwgYmluW2pdOwogICAgICAgIH0KICAgICAgICBjb3V0IDw8IGVuZGw7CiAgICAgICAgcmV0dXJuOwogICAgfQoKICAgIGJpbltpXSA9IDA7CiAgICBUcnkoaSArIDEpOwoKICAgIGJpbltpXSA9IDE7CiAgICBUcnkoaSArIDEpOwp9CgppbnQzMl90IG1haW4oKSB7CiAgICBpb3M6OnN5bmNfd2l0aF9zdGRpbyhmYWxzZSk7CiAgICBjaW4udGllKG51bGxwdHIpOwogICAgY291dC50aWUobnVsbHB0cik7CgogICAgaWYgKGZvcGVuKE5BTUUiLklOUCIsICJyIikpIHsKICAgICAgICBmcmVvcGVuKE5BTUUiLklOUCIsICJyIiwgc3RkaW4pOwogICAgICAgIGZyZW9wZW4oTkFNRSIuT1VUIiwgInciLCBzdGRvdXQpOwogICAgfQoKICAgIGNpbiA+PiBuOwogICAgVHJ5KDEpOwoKICAgIHJldHVybiAwOwp9Cg==