#include #define fi first #define se second #define eb emplace_back #define mp make_pair using namespace std; typedef long double ld; typedef long long ll; typedef unsigned long long ull; typedef __int128 i128; template T ceil(T x, U y) {return (x>0?(x+y-1)/y:x/y);} template T floor(T x, U y) {return (x>0?x/y:(x-y+1)/y);} template bool chmax(T &a,const S b) {return (a bool chmin(T &a,const S b) {return (a>b?a=b,1:0);} int popcnt(int x) {return __builtin_popcount(x);} int popcnt(ll x) {return __builtin_popcountll(x);} int topbit(int x) {return (x==0?-1:31-__builtin_clz(x));} int topbit(ll x) {return (x==0?-1:63-__builtin_clzll(x));} int lowbit(int x) {return (x==0?-1:__builtin_ctz(x));} int lowbit(ll x) {return (x==0?-1:__builtin_ctzll(x));} #define rep(i,a,b) for(int i=(a);i<=(b);i++) #define per(i,a,b) for(int i=(a);i>=(b);i--) typedef pair pii; typedef vector vi; typedef vector vp; int read() { int x=0,w=1; char c=getchar(); while(!isdigit(c)) {if(c=='-') w=-1; c=getchar();} while(isdigit(c)) {x=x*10+(c-'0'); c=getchar();} return x*w; } const int N=2009; int n,m,k; char s[N][N]; void work(int k,int &x,int &y) { if(k==1) {s[x][y]='.'; return;} rep(i,x,x+k/2) rep(j,y,y+(k+1)/2) s[i][j]='.'; x+=k/2, y+=(k+1)/2; work(k/2,x,y); work((k+1)/2,x,y); } signed main() { k=read(); n=m=1; work(k,n,m); rep(i,1,n) rep(j,1,m) if(!s[i][j]) s[i][j]='#'; printf("%d %d\n",n,m); rep(i,1,n) { rep(j,1,m) putchar(s[i][j]); puts(""); } return 0; }