#include <bits/stdc++.h> using namespace std; #define print(l) for(auto i:l) cout<<i<<" ";cout<<endl; #define input(t,l,n) vector<t>l(n);for(int i = 0;i<n;i++)cin>>l[i]; #define int long long #define pb push_back #define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> #define all(l) l.begin(),l.end() #define pii pair<int,int> #define fi first #define se second const int M = 1e9+7; const int inf = 1e18; int bp(int x, int y, int p){ int res = 1; x = x % p; while (y > 0) { if (y & 1) res = (res * x) % p; y = y >> 1; x = (x * x) % p; } return res; } int MI(int n, int p){ return bp(n, p - 2, p); } int mul(int x,int y, int p){ return x * 1ull * y % p; } int di(int x,int y, int p){ return mul(x, MI(y, p), p); } int n , m , k , q; void solve(int testcase_number){ cin>>n; vector<string>si; for(int i = 60;i>=0;i--){ if(n&(1ll<<i)){ for(int j = i;j>=0;j--){ int k = j; string s= ""; while(k--){ // cout<<"X"; s+="X"; } if(j)si.pb(s); // if(j)cout<<endl; } string s; s = "X"; si.pb(s); } } int mx = 0; for(auto i:si){ mx = max(mx,(int)i.size()); } cout<<si.size()+1<<" "<<mx+1<<endl; for(auto i:si){ while((int)i.size() < mx){ i+='.'; } i+='d'; cout<<i<<endl; } for(int i = 1;i<mx;i++){ cout<<'r'; } cout<<'.'<<endl; } signed main(){ ios::sync_with_stdio(0);//DO NOT USE IN INTERACTIVE cin.tie(0), cout.tie(0); cout << fixed<<setprecision(9); int t = 1; // cin>>t; for(int i = 1;i<=t;i++){ solve(i); } }