#include <bits/stdc++.h>
#define For(i, a, b) for(int (i)=(int)(a); (i)<(int)(b); ++(i))
#define rFor(i, a, b) for(int (i)=(int)(a)-1; (i)>=(int)(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef unsigned long long ulint;
typedef pair<int, int> pii;
typedef pair<lint, lint> pll;
template<class T> bool chmax(T &a, const T &b){if(a<b){a=b; return true;} return false;}
template<class T> bool chmin(T &a, const T &b){if(a>b){a=b; return true;} return false;}
template<class T> T div_floor(T a, T b){
    if(b < 0) a *= -1, b *= -1;
    return a>=0 ? a/b : (a+1)/b-1;
}
template<class T> T div_ceil(T a, T b){
    if(b < 0) a *= -1, b *= -1;
    return a>0 ? (a-1)/b+1 : a/b;
}

constexpr lint mod = 1000000007;
constexpr lint INF = mod * mod;
constexpr int MAX = 200010;

int dx[2][7] = {{1, 1, 0, 0, 0, -1, -1}, {1, 1, 0, 0, 0, -1, -1}};
int dy[2][7] = {{-1, 0, -1, 0, 1, -1, 0}, {0, 1, -1, 0, 1, 0, 1}};
vector<int> pos[5] = {{1, 2, 3}, {0, 1, 2, 3}, {0, 1, 2, 3, 4}, {0, 1, 2, 3}, {1, 2, 3}};
int c[128];
using board = array<array<int, 5>, 5>;

board filter(board a){
    board b;
    rep(i, 5)rep(j, 5) b[i][j] = 0;
    for(int i=1; i<=3; ++i){
        For(j, 1, pos[i].size()-1){
            int S = 0, x = i, y = pos[i][j];
            rep(k, 7){
                int nx = x + dx[i%2][k], ny = y + dy[i%2][k];
                S |= (a[nx][ny] << k);
            }
            b[x][y] = c[S];
        }
    }
    return b;
}

void solve(){
    rep(S, 1<<19){
        board a;
        rep(i, 5)rep(j, 5) a[i][j] = 0;
        int cur = 0;
        rep(i, 5)for(int j: pos[i]){
            a[i][j] = (S>>cur & 1);
            ++cur;
        }
        board b = filter(a), b2 = filter(b);
        if(b[2][2] != b2[2][2]){
            puts("no");
            return;
        }
    }
    puts("yes");
}

int main(){
    string s;
    while(cin >> s && s != "#"){
        rep(i, 128) c[i] = s[i] - '0';
        solve();
    }
}
