#include <bits/stdc++.h>
using namespace std;
const int N = 2050;
int n;
char mp[N][N];
void dfs(int k, int x, int y) {
if (k == 1) {
mp[x][y] = '/';
mp[x][y+1] = '\';
mp[x+1][y-1] = '/';
mp[x+1][y] = '';
mp[x+1][y+1] = '';
mp[x+1][y+2] = '\';
return ;
}
int len = 1 << (k - 1);
dfs(k-1, x, y);
dfs(k-1, x+len, y-len);
dfs(k-1, x+len, y+len);
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
memset(mp, ' ', sizeof mp);
cin >> n;
dfs(n, 1, 1 << n);
int res = 1 << n;
for (int i = 1; i <= res; i++) {
for (int j = 1; j <= (1 << n)+i; j++) {
cout << mp[i][j];
}
cout << '\n';
}
return 0;
}
