#include <bits/stdc++.h>

using namespace std;

typedef long long int ll;
typedef double ld;

typedef pair<ll, ll> ii;
typedef vector<ll> vi;
typedef vector<ii> vii;

#define PB push_back
#define ff first
#define ss second

#define FOR(prom,a,b) for ( ll prom = (a); prom < (ll)(b); ++prom)
#define F(a) FOR(i,0,a)
#define FF(a) FOR(j,0,a)

//#define M_PI 3.14159265358979323846
#define EPS (1e-10)
#define EQ(a,b) (fabs(a-b) <= fabs(a+b)*EPS)
#define LINF (1<<62LL)
#define DEB cerr<<"DEB: "

#define MX 0

char arr[3][3];



int main() {
	ios::sync_with_stdio(false);


	cin >> arr[0][0] >> arr[1][0] >> arr[2][0];	
	cin >> arr[0][1] >> arr[1][1] >> arr[2][1];	
	cin >> arr[0][2] >> arr[1][2] >> arr[2][2];

	ll cnt = 0;

	F(3)
		FF(3)
			if ( arr[i][j] == 'o' )
				++cnt;

	switch(cnt) {

		case 1 :
			if (arr[1][1] == 'o') {
				cout << 1 << endl;
				return 0;
			}
			break;
		case 2 :
			if ((arr[0][0] == 'o' && arr[2][2] == 'o') ||
				(arr[0][2] == 'o' && arr[2][0] == 'o') ) {
					cout << 2 << endl;
					return 0;
				}
			break;
		case 3 :
			if ( (arr[0][0] == 'o' && arr[1][1] == 'o' && arr[2][2] == 'o') ||
				(arr[0][2] == 'o' && arr[1][1] == 'o' && arr[2][0] == 'o') ) {
				cout << 3 << endl;
				return 0;
			}
			break;
		case 4 :
			if (arr[0][0] == 'o' && arr[2][0] == 'o' && arr[0][2] == 'o' && arr[2][2] == 'o') {
				cout << 4 << endl;
				return 0;
			}
			break;
		case 5 :
			if (arr[0][0] == 'o' && arr[2][0] == 'o' && arr[0][2] == 'o' && arr[2][2] == 'o' 
				&& arr[1][1] == 'o') {
					cout << 5 << endl;
					return 0;
				}
			break;
		case 6 :
			if ((arr[0][0] == 'o' && arr[1][0] == 'o' && arr[2][0] == 'o' &&
				arr[0][2] == 'o' && arr[1][2] == 'o' && arr[2][2] == 'o') ||
			(	arr[0][0] == 'o' && arr[0][1] == 'o' && arr[0][2] == 'o' &&
				arr[2][0] == 'o' && arr[2][1] == 'o' && arr[2][2] == 'o') ) {
				cout << 6 << endl;
				return 0;
			}
			break;
	}
	
	cout << "unknown" << endl;				

	return 0;

}