#include<iostream>
#include<map>
#include<vector>
#include<algorithm>
#include<deque>
#include<cassert>
using namespace std;
vector<pair<int,int> >V;
int H,W;
void f(int N)
{
	if(N==1)return;
	if(N%2==0)
	{
		H+=N/2;
		W+=N/2;
		V.push_back(make_pair(N/2,N/2));
		f(N/2);
		f(N/2);
	}
	else
	{
		H+=(N+1)/2;
		W+=(N-1)/2;
		V.push_back(make_pair((N+1)/2,(N-1)/2));
		f((N+1)/2);
		f((N-1)/2);
	}
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int N;
	cin>>N;
	f(N);
	cout<<H+1<<" "<<W+1<<"\n";
	vector<string>S(H+1,string(W+1,'#'));
	int x=0,y=0;
	V.push_back(make_pair(0,0));
	for(pair<int,int>hw:V)
	{
		for(int i=0;i<=hw.first;i++)for(int j=0;j<=hw.second;j++)
		{
			S[x+i][y+j]='.';
		}
		x+=hw.first;
		y+=hw.second;
	}
	for(int i=0;i<=H;i++)cout<<S[i]<<"\n";
}