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

#define int long long

#define rep(i,a,b) for(int i = a; i < b; i++)


const int n = 2025;

vector<vector<int>> used(n, vector<int>(n, 0)), ans(n, vector<int>(n, 0));

signed main() {

    ll k; cin >> k;


    vector<pair<ll, pair<ll,ll>>> s;
    rep(x,2,n) rep(y,2,n) {
        if (y > 2000) continue;
        else if (x > y && x < 2000) continue;
        ll v1 = x*(x-1)/2;
        ll v2 = y*(y-1)/2;

        s.push_back({v1*v2, {x, y}});
    }

    sort(s.begin(), s.end());


    int i = s.size()-1;
    ll l = n, v = n, st = 0;
    

    while (k > 0) {
        if (i < 0) break;
        auto [v, _] = s[i--];
        auto [x, y] = _;

        if (v > k) continue;
        if (x > l) continue;

        rep(i,st,st+x) rep(j,0,y) ans[i][j] = 1;


        k -= v;
        l -= (x+1);
        st += (x+1);
        i++;
    }

    s.clear();

    rep(x,2,40) rep(y,2,24) {
        ll v1 = x*(x-1)/2;
        ll v2 = y*(y-1)/2;

        s.push_back({v1*v2, {x, y}});
    }

    sort(s.begin(), s.end());


    ll sty = 2001;
    st = 0; l = n;

    i = s.size()-1;
    while(k > 0) {
        if (i < 0) break;
        auto [v, _] = s[i--];
        auto [x, y] = _;

        if (y > x) swap(x, y);
        if (y > 24) continue;
        if (v > k) continue;
        if (x > l) continue;

        rep(i,st,st+x) rep(j,sty,sty+y) ans[i][j] = 1;

        k -= v;
        l -= (x+1);
        st += (x+1);
        i++;
    }

    cout << n << " " << n << endl;
    rep(i,0,n) {
        rep(j,0,n) cout << ((ans[i][j]) ? "#" : ".");
        cout << endl;
    }
}