#include<bits/stdc++.h>
using namespace std;
#define MAXN 105
#define ll long long
#define int long long
const ll mod = 1e9 + 7;
int n;
ll f[105];
vector<char> s;
vector<int> v, from;
unordered_map<int, int> mp;
ll qpow(ll a, ll b){
    ll ret = 1;
    while(b){
        if(b & 1) ret = ret * a % mod;
        a = a * a % mod;
        b >>= 1;
    }
    return ret;
}
void init(){
    queue<pair<int, int>> q;
    q.push({1, 0});
    int cnt = 1;
    mp[1] = 1;
    v.push_back(1); from.push_back(0);
    while(!q.empty() && cnt < 1e6){
        auto [x, t] = q.front();
        q.pop();
        for(int i=2;i<100-t;i++){
            int x1 = ((ll)x * f[i])  % mod;
            int t1 = (t+i+1);
            if(mp[x1]) continue;
            mp[x1] = ++cnt;
            v.push_back(x1), from.push_back(i);
            if(t1 != 100) q.push({x1, t1});
        }
    }
    // printf("cnt = %d\n", cnt);
}
void print(int x){
    // printf("x = %d\n", x);
    int tmp = x;
    ll check = 1;
    while(tmp != 1){
        if(s.size()) s.push_back('#');
        int id = mp[tmp] - 1;
        for(int i=1;i<=from[id];i++) s.push_back('.');
        check = check * f[from[id]] % mod;
        tmp = (ll) tmp * qpow(f[from[id]], mod-2) % mod;
    }
    tmp = n * qpow(x, mod-2) % mod;
    while(tmp != 1){
        if(s.size()) s.push_back('#');
        int id = mp[tmp] - 1;
        // printf("tmp = %d, id = %d, from = %d\n", tmp, id, from[id]);
        for(int i=1;i<=from[id];i++) s.push_back('.');
        check = check * f[from[id]] % mod;
        tmp = (ll) tmp * qpow(f[from[id]], mod-2) % mod;
    }
    // if(check != n) assert(0);
    // if(s.size() > 200) assert(0);
    for(auto c : s) putchar(c); putchar('\n');
    for(auto c : s) putchar(c); putchar('\n');
}
signed main(){
    f[0] = f[1] = 1;
    for(int i=2;i<=100;i++) f[i] = (f[i-1] + f[i-2]) % mod;//, printf("%lld\n", f[i]);
    cin>>n;
    if(n == 0){
        puts("##.\n.##");
        return 0;
    }else if(n == 1){
        puts(".\n.");
        return 0;
    }
    init();
    for(auto x : v){
        int tmp = (ll)n * qpow(x, mod-2) % mod;
        int &X = mp[tmp];
        if(X) return print(x), 0;
    }
    assert(0);
    return 0;
}