import sys

# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)

# md = 10**9+7
md = 998244353

from collections import deque

n = II()
if n == 1:
    print(1, 1)
    print(".")
    exit()

q = deque()
q.append(n)
ans = [["#"]*2000 for _ in range(2000)]
si = sj = 0
while q:
    f = q.popleft()
    if f == 2:
        h = w = 1
    elif f == 3:
        h = w = 2
    else:
        h = f//2
        w = f-h
        q.append(h)
        q.append(w)
    if si < sj: h, w = w, h
    for i in range(si, si+h+1):
        for j in range(sj, sj+w+1):
            ans[i][j] = "."
    si += h
    sj += w

print(si+1,sj+1)
for r in ans[:si+1]: print(*r[:sj+1], sep="")