// #include <bits/stdc++.h>
#include <iostream>
#include <cmath>
#include <algorithm>
#include <map>
#include <unordered_map>
#include <vector>
#include <iomanip>
#include <string>
#include <queue>
#include <set>
#include <deque>
using namespace std;
#define endl "\n"
#define pb push_back
#define int long long
#define fi first
#define se second
const int N = 3e5 + 5, M = 1e9 + 7, LG = 20;
int n , A[N] , k;
void solve(){
cin >> k;
cout << 5 << ' ' << 5 << endl;
for (int i=1 ; i<=5 ; i++){
for (int j=1 ; j<=5 ; j++){
if (i==5 && j==5){
cout << ".";
continue;
}
if (i==5){
cout << "r";
continue;
}
if (j==5){
cout << "d";
continue;
}
if (k-1){
cout << "X";
k--;
}else{
cout << ".";
}
}
cout << endl;
}
}
signed main(){
// freopen("" , "r" , stdin);
// freopen("" , "w" , stdout);
// cout << setprecision(30);
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int ts = 1;
// cin >> ts;
while(ts--){
solve();
}
}
