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

void dfs(int n,vector<pair<int,int>>&tmp) {
    if(n == 1) return;
    tmp.push_back({(n+1)/2+1,n/2+1});
    dfs(n/2,tmp);
    dfs((n+1)/2,tmp);
}

int main() {
    int N;
    cin >> N;
    if(N == 1) {
        cout << "1 1" << endl;
        cout << "." << endl;
        return 0;
    }
    vector<pair<int,int>>tmp;
    dfs(N,tmp);
    int sum1 = 0,sum2 = 0;
    for(int i = 0; i < tmp.size(); i++) {
        sum1 += tmp[i].first;
        sum2 += tmp[i].second;
    }
    cout << sum1-tmp.size()+1 << " " << sum2-tmp.size()+1 << endl;
    vector<string>ans(sum1-tmp.size()+1,string(sum2-tmp.size()+1,'#'));
    sum1 = 0,sum2 = 0;
    for(int i = 0; i < tmp.size(); i++) {
        if(i) {
            sum1--;
            sum2--;
        }
        for(int j = sum1; j < sum1+tmp[i].first; j++) {
            for(int k = sum2; k < sum2+tmp[i].second; k++) {
                ans[j][k] = '.';
            }
        }
        sum1 += tmp[i].first;
        sum2 += tmp[i].second;
    }
    for(int i = 0; i < sum1; i++) {
        cout << ans[i] << endl;
    }
}