#include <iostream>
#include <set>
#include <queue>
#include <vector>
#include <string>
#include <math.h>
#include <cmath>
#include <map>
#include <unordered_map>
#include <stack>
#include <algorithm>
#include <stdio.h>
#include <cstring> // For memset
#include <sstream>
using namespace std;
#define lop(i,n) for(int i = 0 ; i < n ;i++)
#define VI vector<int>
#define VLL vector<ll>
#define VPI vector<pair<int , int>>
#define VII vector<VI>
#define all(v) v.begin() , v.end()
#define SORT(v) sort(all(v))
#define ll long long
#define ull unsigned long long
#define scni(x) scanf("%d",&x) // int
#define scnll(x) scanf("%lld",&x) // ll
#define scnd(x) scanf("%lf",&x) // double
#define prnti(x) printf("%d\n",x) // int
#define prntll(x) printf("%lld",x) // int
#define prntd(x) printf("%.9f",x) // int
#define sz(x) x.size()
#define SPC <<" "<<
#define INF int(1e9)
#define pp push_back
#define P pair<int , int>
#define mp make_pair
const double EPS = 1e-9;
const double PI = 3.14159265359;
// O( n * log(log(n)) )
vector<ll> primes;
void GeneratingPrimes(int top){
vector<bool> p (top+1 , 1);
// vector<ll> primes;
p[0] = p[1] = 0;
for(int i = 2; i <= sqrt(top) ; i++){
if(p[i]){
for(int j = i*i ; j <= top ; j+=i){
p[j]=0;
}
}
}
lop(i , top+1)
if(p[i])primes.push_back(i);
// return primes;
}
ll gcd(ll a ,ll b){return (b==0)?a : gcd(b , a%b);}
ll lcm(ll a, ll b){return (a * b) / gcd(a , b);}
void EXTgcd(ll a , ll b , int & x0 , int & y0){
if(b==0){ x0 =1 , y0 = 0; return; }
EXTgcd( b , a%b , x0 , y0 );
ll x1 = y0;
ll y1 = x0 - (a/b) * y0;
x0 = x1;
y0 = y1;
}
ll power(ll x, ll y, ll p)
{
ll res = 1;
x = x % p;
while (y > 0)
{
if (y & 1)
res = (res*x) % p;
y = y>>1;
x = (x*x) % p;
}
return res % p;
}
double dist(double a , double b , double x, double y){ return sqrt( pow( a-x ,2) + pow( b-y ,2) ); }
double dist3(double a , double b , double c , double x , double y ,double z ){ return sqrt( pow( a-x ,2) + pow( b-y ,2) + pow( c-z ,2)); }
int xadd[9]= { 1 , -1 , 0 , 1 , -1 , 0 , 1 , -1 , 0 };
int yadd[9]= { 1 , -1 , 0 ,-1 , 0 , 1 , 0 , 1, -1 };
#define no { cout<<"NO"; }
#define yes { cout<<"YES";}
#define _1 { cout<<"-1"; return 0;}
ll const N = 1e5 + 10;
ll mod = 998244353;
///////////////////////////////////////////////////////////////////
char a[8][8];
int main(){
lop(i,8)lop(j,8){cin >> a[i][j];}
lop(i,8){
lop(j, 7)cout << a[i][j] << "&";
cout << a[i][7] << "\\" << "\\" <<endl;
}
return 0;}