# include <bits/stdc++.h>
using namespace std ;
# define ull unsigned long long
# define ll long long
# define db double
# define random( a , b ) ( rand( ) % ( ( b ) - ( a ) + 1 ) + ( a ) )
# define se second
# define fi first
# define pr pair < int , int >
# define pb push_back
# define ph push
# define ft front
# define vec vector
# define For( i , a , b ) for ( int i = a ; i <= b ; i ++ )
# define Rep( i , a , b ) for ( int i = a ; i >= b ; i -- )
# define mem( a , b ) memset ( a , b , sizeof ( a ) )
# define NO cout << "NO" << "\n" ;
# define YES cout << "YES" << "\n" ;
# define No cout << "No" << "\n" ;
# define Yes cout << "Yes" << "\n" ;
# define rt return
# define str string
const int N = 20 , M = 1e7 ;
int T , n , g [ N ] , f [ N ] , ans , Cnt , vis [ M ] ;
char s [ N ][ N ] ;
inline int check (  )
{
	double tot = 0 ;
	int a = s [ 0 ][ f [ 0 ] ] - '0' , b = s [ 1 ][ f [ 1 ] ] ;
	int c = s [ 2 ][ f [ 2 ] ] - '0' , d = s [ 3 ][ f [ 3 ] ];
	if ( b == '+' ) tot = a + c ;
	if ( b == '-' ) tot = a - c ;
	if ( b == '*' ) tot = a * c ;
	if ( b == '/' )
	{
		if ( c == 0 )
		{
			return 0 ;
		}
		tot = a * 1.0 / c ;
	}
	int sum = ( s [ 4 ][ f [ 4 ] ] - '0' ) * 10 + s [ 5 ][ f [ 5 ] ] - '0' ;
	if ( d == '>' ) return tot > sum ;
	if ( d == '=' ) return tot == sum ;
	if ( d == '<' ) return tot < sum ; 
}
inline void dfs ( int cnt , int r )
{
	if ( cnt > 5 )
	{
		if ( vis [ r ] == 1 )
		{
			return ;
		}
		int ans1 = 0 ;
		For ( i , 0 , n - 1 )
		{
			int R = 0 ;
			For ( j , 0 , 5 )
			{
				f [ j ] = ( g [ j ] + i ) % n ;
				R = R * 10 + f [ j ] ;
			}
			vis [ R ] = 1 ;
			if ( check ( ) == 1 ) ans1 ++ ;
		}
		ans = max ( ans1 , ans ) ;
        return ;
	}
	For ( i , 0 , n - 1 )
	{
		g [ cnt ] = i ;
		dfs ( cnt + 1 , r * 10 + i ) ;
	}
}
void solve ( )
{
    cin >> n ;
    For ( i , 0 , 5 )
    {
    	cin >> s [ i ] ;
	}
	dfs ( 0 , 0 )  ;
	cout << ans << "\n" ;
}
int main ( )
{
//	freopen ( "lock.in" , "r" , stdin ) ;
//	freopen ( "lock.out" , "w" , stdout ) ;
	ios :: sync_with_stdio ( false ) ;
    cin . tie ( 0 ) ;
    srand ( time ( 0 ) ) ;
//    cin >> T ;
//    while ( T -- )
	solve ( ) ;
	rt 0 ;
}