/*
TASK:cannibal
LANG:C
*/
#include <stdio.h>

int a[ 128 ];
int ans[ 128 ];
int n=102;
int pr = 3;
int x;

void init( )
{	int i;
	for ( i=0; i<n; i++ )
	{	scanf( "%d", &a[ i ] );
		if ( a[ i ] == -1 ) x = i; }
	for ( i=0; i<n; i++ )
		scanf( "%d", &ans[ i ] );
}

void	solve( )
{	int p[ 8 ], i, pc=0, c;
 	if ( ans[ x / pr ] != -1 )
		p[ ++pc ] = ans[ x / pr ];
	for ( i=1; i<=pr; i++ )
	{ 	if ( ( (x * pr) + i <= 101 ) && ( ans[ (x * pr) + i ] == -1 ) )
			p[ ++pc ] = a[ ( x * pr ) + i ];
   }
	int m, m1=0, mc;
	for ( c=0; c<=2; c++ )
	{	for ( m = 0, i=1; i<=pc; i++ )
			if ( p[ i ] == c ) m++;
		if ( m > m1 ) { m1 = m; mc = c; }
	}

	printf( "%d\n", mc );
}

int main( )
{	init( );
	solve( );

	return 0;
}
