#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

const int N = 9, M = 1 << N;

int ones[M], map[M];
int row[N], col[N], cell[3][3];
char str[100];

void init () {
    //行列的初始状态
}

void draw (int x, int y, int t, bool is_set) {
    //填数
    //更新
}
//获取1
int lowbit( int x) {

}
//得到(x, y)的所在行列小方格状态
int get(int x,int y) {

}
bool dfs (int cnt) {

    //顺序剪枝

}
int main () {
    for (int i = 0; i < N; i ++) 
        //求map
    for (int i = 0; i < 1 << N; i++) 
        for (int j = 0; j < N; j ++)
            //求ones

    while (cin >> str, str[0] != 'e') {
        //初始化
        //求空位数量
        //遍历状态空间
        puts (str);
    }
    return 0;
}