/*
ID:   cs_diab1
TASK: 
LANG: C++
*/

#include <map>
#include <set>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <cctype>
#include <cstdio>
#include <limits>
#include <string>
#include <vector>
#include <cassert>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <numeric>
#include <sstream>
#include <utility>
#include <iostream>
#include <algorithm>
#include <functional>

#define stop exit(0)
#define nc -1
#define eps 1e-10
#define inf 1000000000
#define mod 1000000007
#define mp make_pair
#define MAX 20

#define fill(array,value) memset(array,value,sizeof(array))
#define f(i,beg,end) for(int i=beg; i<=end; i++)
#define F(i,beg,end) for(int i=beg; i>=end; i--)
#define Max(a,b) ( (a>b)?a:b )
#define Min(a,b) ( (a<b)?a:b )
#define pi 3.1415926535897932384626433832
#define iread(var) scanf("%d",&var)
#define dread(var) scanf("%f",&var)
#define lread(var) scanf("%lld",&var)
#define input(name) freopen(name,"r",stdin)
#define output(name) freopen(name,"w",stdout)
typedef unsigned long long ull;
typedef unsigned int ui;
typedef long double ld;
typedef long long ll;

using namespace std;

ll k;
ll g[MAX+1][MAX+1], used[MAX+1][MAX+1];
char sol[MAX+1][MAX+1];

void redirect()
{
    input("park.in");
    output("park.out");
}

ll komb(int n, int k)
{
    ll ret=1LL;
    
    for(int i=n, j=1; j<=k; i--, j++)
    {
        ret*=1LL*i;
        ret/=1LL*j;
    }
    
    return ret;
}

void dfs(int row, int col, ll& left, int s)
{
    int prevr=row-1, prevc=col-1;
    
    //cout<<row<<" "<<col<<" "<<g[row][col]<<" "<<left<<endl;
    if (used[row][col]) return;
    
    if (!left) return;
    if (row==0 && col==0) return;
    
    int ok1=0, ok2=0;
    
    if (prevr>-1)
    {
        if (g[prevr][col]<=left)
        {
            sol[prevr][col]='#';
            left-=g[prevr][col];
            ok1=1;
        }
    }
    
    if (prevc>-1)
    {
        if (g[row][prevc]<=left)
        {
            sol[row][prevc]='#';
            left-=g[row][prevc];
            ok2=1;
        }
    }
    
    used[row][col]=1;
    
    if (!ok1 && ok2) { dfs(prevr,col,left,s); return; }
    if (ok1 && !ok2) { dfs(row,prevc,left,s); return; }
    
    if (prevr>-1) dfs(prevr,col,left,s);
    else dfs(row,prevc,left,s);
}

void mark(long long left)
{
    ll g1[21][21];
    
    f(i,0,20)
        f(j,0,20)
        {
            g1[i][j]=g[i][j]*komb(2*MAX+2-i-j,i);
        }
    
    f(i,0,20)
    {
        f(j,0,20)
            cout<<g1[i][j]<<" ";
        cout<<endl;
    }
}

void solve()
{
    
    g[0][0]=1;
    f(i,0,MAX)
        f(j,0,MAX)
            if (i || j)
            {
                ll a1 = (i>0) ? g[i-1][j] : 0;
                ll a2 = (j>0) ? g[i][j-1] : 0;
                g[i][j] = a1 + a2; 
            }
    
    //f(i,0,MAX) { f(j,0,MAX) cout<<g[i][j]<<" "; cout<<endl; }
    
    ll left = g[MAX][MAX] - k;
    
    f(i,0,MAX) f(j,0,MAX) sol[i][j]='.';
    
    
    dfs(MAX,MAX,left,0);
    //mark(left);
    
    ll d[MAX+1][MAX+1];
    d[0][0]=1;
    f(i,0,MAX)
        f(j,0,MAX)
            if (i || j)
            {
                ll a1 = (i>0) ? d[i-1][j] : 0;
                ll a2 = (j>0) ? d[i][j-1] : 0;
                if (sol[i][j]=='.') d[i][j]=a1+a2;
                else d[i][j]=0;
            }
    
    /*f(i,0,MAX)
    {
        f(j,0,MAX)
            cout<<setw(6)<<d[i][j]<<" ";
        cout<<endl;
    } cout<<endl;
    f(i,0,MAX)
    {
        f(j,0,MAX)
            cout<<setw(6)<<g[i][j]<<" ";
        cout<<endl;
    }*/
    
    //ok=(d[MAX][MAX]==k);
}

void print(int cnt)
{
    cout<<cnt<<" "<<cnt<<endl;
    f(i,0,cnt)
    {
        f(j,0,cnt)
            cout<<sol[i][j];
        cout<<endl;
    }
}

void init()
{
    cin>>k;
    
    if (k==1)
    {
        cout<<".\n";
        cout<<k<<endl;
        return;
    }
    
    solve();
    print(MAX);
}

int main()
{
    redirect();
    //input("test.txt");
    //8output("sol.txt");
    init();

    return 0;
}
<!-- 0.0422s -->