import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } enum MAX_N = 400; void main() { auto dp = new int[MAX_N + 1]; dp[1] = 0; foreach (n; 2 .. MAX_N + 1) { const m0 = n / 2; const m1 = n - m0; dp[n] = max(m0, m1) + dp[m0] + dp[m1]; } debug { writeln(dp); } try { for (; ; ) { const N = readInt; auto ans = new char[][](dp[N] + 1, dp[N] + 1); foreach (x; 0 .. dp[N] + 1) { ans[x][] = '#'; } int X, Y; ans[X][Y] = '.'; void solve(int n) { if (n == 1) { return; } const m0 = n / 2; const m1 = n - m0; foreach (i; 0 .. m0 + 1) foreach (j; 0 .. m1 + 1) { ans[X + i][Y + j] = '.'; } X += m0; Y += m1; solve(m0); solve(m1); } solve(N); writeln(X + 1, " ", Y + 1); foreach (x; 0 .. X + 1) { writeln(ans[x][0 .. Y + 1]); } } } catch (EOFException e) { } }