#include <stdio.h>#include <string.h>#include <math.h>#include <stdlib.h>#include <iostream>#include <queue>#include <stack>#include <map>#include <vector>#include <algorithm>#define N 15#define M#define E#define inf 0x3f3f3f3f#define eps 1e-8#define linf (LL)1<<60#define dinf 1e20#define LL long long#define clr(a,b) memset(a,b,sizeof(a))#define D(a) ((a)*(a))using namespace std;int d;char gra[5][5];int r[N],c[N];char gc(int x,int y,int d){ if(d==1)return gra[x][y]; if(x>=0&&x<r[d-1]&&((y>=0&&y<c[d-1]/2)||(y>=c[d-1]/2*3&&y<c[d])))return ' '; if(x>=0&&x<r[d-1]) return gc(x,y-c[d-1]/2,d-1); if(y<c[d-1]) return gc(x-r[d-1],y,d-1); return gc(x-r[d-1],y-c[d-1],d-1);}int main(){ gra[0][0]=' ';gra[0][1]='/';gra[0][2]='\';gra[0][3]=' '; gra[1][0]='/';gra[1][1]='_';gra[1][2]='_';gra[1][3]='\'; r[1]=2;c[1]=4; for(int i=2;i<=10;i++) { r[i]=r[i-1]*2; c[i]=c[i-1]*2; } while(scanf("%d",&d),d) { for(int i=0;i<r[d];i++) { int lim=-1; for(int j=c[d]-1;j>=0;j--) if(gc(i,j,d)!=' ') { lim=j; break; } for(int j=0;j<=lim;j++) printf("%c",gc(i,j,d)); puts(""); } puts(""); } return 0;}
