#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
using namespace std;

string str;

int cal(int x, int a0, int a1, int a2, int a3, int a4, int a5, int a6){
	int z = 0;
	z += ((x&(1<<a0))!=0)<<0;
	z += ((x&(1<<a1))!=0)<<1;
	z += ((x&(1<<a2))!=0)<<2;
	z += ((x&(1<<a3))!=0)<<3;
	z += ((x&(1<<a4))!=0)<<4;
	z += ((x&(1<<a5))!=0)<<5;
	z += ((x&(1<<a6))!=0)<<6;
	return str[z]-'0';
}

void solve(){
	bool ok = true;
	for(int i = 0; i < (1<<19); i++){
		int j = 0;
		j += (cal(i,0,1,3,4,5,8,9)<<0);
		j += (cal(i,1,2,4,5,6,9,10)<<1);
		j += (cal(i,3,4,7,8,9,12,13)<<2);
		j += (cal(i,4,5,8,9,10,13,14)<<3);
		j += (cal(i,5,6,9,10,11,14,15)<<4);
		j += (cal(i,8,9,12,13,14,16,17)<<5);
		j += (cal(i,9,10,13,14,15,17,18)<<6);
		if(cal(i,4,5,8,9,10,13,14) != cal(j,0,1,2,3,4,5,6)){
			ok = false;
			break;
		}
	}
	if(ok) puts("yes");
	else puts("no");
}

int main(){
	while(cin >> str,str[0]!='#'){
		solve();
	}
}