//qoj8632
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int n;
char s[6][23];

int calc(int a, int b, int c, int d, int e, int f){
	int x = s[0][a] - '0', y = s[2][c] - '0', z = (s[4][e] - '0') * 10 + s[5][f] - '0';
	int le = 0, ri = z;
	if(s[1][b] == '+'){
		le = x + y;
	} else if(s[1][b] == '-'){
		le = x - y;
	} else if(s[1][b] == '*'){
		le = x * y;
	} else {
		if(y == 0 || x % y != 0){
			return 0;
		}
		le = x / y;
	}
	if(s[3][d] == '='){
		return le == ri ? 1 : 0;
	} else if(s[3][d] == '<'){
		return le < ri ? 1 : 0;
	} else {
		return le > ri ? 1 : 0;
	}
}

int main(){
	scanf("%d", &n);
	scanf("%s", s[0]);
	scanf("%s", s[1]);
	scanf("%s", s[2]);
	scanf("%s", s[3]);
	scanf("%s", s[4]);
	scanf("%s", s[5]);
	for(int i = 0; i <= 5; ++ i){
		for(int j = 0; j < n; ++ j){
			s[i][j+n] = s[i][j];
		}
	}
	int ans = 0;
	for(int b = 0; b < n; ++ b){
		for(int c = 0; c < n; ++ c){
			for(int d = 0; d < n; ++ d){
				for(int e = 0; e < n; ++ e){
					for(int f = 0; f < n; ++ f){
						int cnt = 0;
						for(int i = 0; i < n; ++ i){
							cnt += calc(0+i, b+i, c+i, d+i, e+i, f+i);
						}
						ans = max(ans, cnt);
					}
				}
			}
		}
	}
	printf("%d\n", ans);
	return 0;
}