#include void DFS(int N, int *H, int *W, char S[][2001]) { if (N == 1) return; int i, j, n[2] = {N / 2, N - N / 2}; for (i = *H; i <= *H + n[0]; i++) for (j = *W; j <= *W + n[1]; j++) S[i][j] = '.'; *H += n[0]; *W += n[1]; DFS(n[0], H, W, S); DFS(n[1], H, W, S); } int main() { int N; scanf("%d", &N); if (N == 1) { printf("1 1\n.\n"); return 0; } int i, j, H = 0, W = 0; static char S[2001][2001] = {}; DFS(N, &H, &W, S); H++; W++; for (i = 0; i < H; i++) for (j = 0; j < W; j++) if (S[i][j] == 0) S[i][j] = '#'; printf("%d %d\n", H, W); for (i = 0; i < H; i++) printf("%s\n", S[i]); fflush(stdout); return 0; }