#include <bits/stdc++.h>
using namespace std;

#define rep(i,n) for(int i=0; i<(n); ++i)
#define st first
#define nd second
#define pb push_back
#define mp make_pair

typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long long ll;
int wyn(vector<int>& v){
	int s = 0;
	for(int i = 0; i < v.size(); i ++) s += (1<<v[i]);
	return s;
}
int solve() {
	int pot = 0;
	int sum = 0;
	char x[3];
	for(int i = 0; i < 3; i ++) {
		scanf(" %s", x);
		for(int j = 0; j < 3; j ++){
			int c = x[j] == 'o';
			if(c) sum += (1<<(pot+j));
		}		
		pot += 3;
	}
	vector<vector<int> > v = { {4} };
	for(int i = 0; i < v.size(); i ++) if(sum == wyn(v[i])) return 1;
	v = {{0,8}, {2,6}};
	for(int i = 0; i < v.size(); i ++) if(sum == wyn(v[i])) return 2;
	v = {{0,4,8},{2,4,6}};
	for(int i = 0; i < v.size(); i ++) if(sum == wyn(v[i])) return 3;
	v = {{0,2,6,8}};
	for(int i = 0; i < v.size(); i ++) if(sum == wyn(v[i])) return 4;
	v = {{0,2,6,8,4}};
	for(int i = 0; i < v.size(); i ++) if(sum == wyn(v[i])) return 5;
	v = {{0,1,2,6,7,8},{0,3,6,2,5,8}};
	for(int i = 0; i < v.size(); i ++) if(sum == wyn(v[i])) return 6;
	return -1;
}

int main(){
int w = solve();
if(w == -1) puts("unknown");
else printf("%d\n", w);
return 0;
}