#include <bits/stdc++.h>
using namespace std;

const int nmax = 100;
const int N = 1e3 + 5, MOD = 1e9 + 7;
int dp[N][N];
int getAns(int n){
    dp[0][0] = 0;
    for(int i = 1; i < n; i++)dp[i][0] = 1;
    dp[n][0] = 2;

    for(int i = 1; i <= n - 2; i++){
        for(int j = 1; j <= n; j++)dp[j][i - 1] = (dp[j][i - 1] + dp[j - 1][i - 1]) % MOD;
        for(int j = 0; j <= n; j++){
            dp[j][i] = 0;
//            for(int k = 0; k <= j; k++){
//                dp[j][i] += dp[j - k][i - 1] + 1;
//            }
            dp[j][i] += dp[j][i - 1] + (j + 1);
            dp[j][i] %= MOD;
        }
    }

//    for(int i = 0; i <= n - 2; i++){
//        for(int j = 0; j <= n; j++)cout << dp[j][i] << ' ';
//        cout << endl;
//    }
//    cout << dp[n][n - 2] << "\n";
    return dp[n][n - 2];
}

int getAns2(int n){
    long long ans = 4;
    for(int i = 3, cur = 3, j = 0; i <= n; i++, j++){
        ans += cur;
        if(j)cur++, j = -1;
    }
    return ans % MOD;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    int n;
    cin >> n;
    if(n == 1){
        cout << "0\n0\n1\n*\n0\n2\n";
        return 0;
    }

    if(n == 2){
        cout << "*0\n00\n3\n*0\n00\n4\n";
        return 0;
    }

    cout << string(n - 2, '*') << "0*\n";
    cout << "0" << string(n - 1, '1') << "\n";
    cout << getAns(n) << "\n";

    cout << string((n + 1) / 2, '*') << string(n / 2, '0') << "\n";
    cout << string(n, '0') << "\n";
    cout << getAns2(n) << "\n";



    return 0;
}