#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void(0)
#endif

using namespace std;

typedef long long ll;
#define all(x) begin(x), end(x)
constexpr int INF = (1 << 30) - 1;
constexpr long long IINF = (1LL << 60) - 1;
constexpr int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};

template <class T> istream& operator>>(istream& is, vector<T>& v) {
    for (auto& x : v) is >> x;
    return is;
}

template <class T> ostream& operator<<(ostream& os, const vector<T>& v) {
    auto sep = "";
    for (const auto& x : v) os << exchange(sep, " ") << x;
    return os;
}

template <class T, class U = T> bool chmin(T& x, U&& y) { return y < x and (x = forward<U>(y), true); }

template <class T, class U = T> bool chmax(T& x, U&& y) { return x < y and (x = forward<U>(y), true); }

template <class T> void mkuni(vector<T>& v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
}

template <class T> int lwb(const vector<T>& v, const T& x) { return lower_bound(begin(v), end(v), x) - begin(v); }

const int MAX = 3000;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int N;
    cin >> N;

    vector<string> ans(MAX, string(MAX, '#'));
    ans[0][0] = '.';
    int x = 0, y = 0;
    auto make = [&](auto self, int n) -> void {
        if (n == 1) return;
        int a = n / 2, b = n - a;
        for (int i = x; i <= x + a; i++) {
            for (int j = y; j <= y + b; j++) {
                ans[i][j] = '.';
            }
        }
        x += a;
        y += b;
        self(self, a);
        self(self, b);
    };
    make(make, N);

    cout << x + 1 << ' ' << y + 1 << '\n';
    for (int i = 0; i <= x; i++) {
        for (int j = 0; j <= y; j++) cout << ans[i][j];
        cout << '\n';
    }
    return 0;
}