#include<iostream>
#include<cstdio>
#include<string.h>
#include<cstring>
#include<string>
#include<stack>
#include<set>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>
#define LOCAL
#define ll long long
#define lll unsigned long long
#define MAX 1000009
#define eps 1e-8
#define INF 0x7fffffff
#define mod 1000000007
using namespace std;
/*
题意:中文题
想法:枚举X + 0.5,然后找出最多符合x + 0.5 的语句
x>5
x<6
x可能是实数
*/
string str[59];
string X;
double num[59];
int main()
{
//freopen("date.in","r",stdin);
int n;
scanf("%d",&n);
for(int i = 0; i<n; i++)
{
cin>>X>>str[i]>>num[i];
}
int ans = -1;
for(double y = -2; y<=1009; y+=0.5)
{
int sum = 0;
for(int i = 0; i<n; i++)
{
bool ok = false;
if(str[i]=="=")
ok = (y == num[i]);
else if(str[i]=="<")
ok = (y < num[i]);
else if(str[i]==">")
ok = (y > num[i]);
else if(str[i]=="<=")
ok = (y <= num[i]);
else if(str[i]==">=")
ok = (y >= num[i]);
if(ok) sum++;
}
ans = max(ans,sum);
}
cout<<ans<<endl;
return 0;
}
#include<cstdio>
#include<string.h>
#include<cstring>
#include<string>
#include<stack>
#include<set>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>
#define LOCAL
#define ll long long
#define lll unsigned long long
#define MAX 1000009
#define eps 1e-8
#define INF 0x7fffffff
#define mod 1000000007
using namespace std;
/*
题意:中文题
想法:枚举X + 0.5,然后找出最多符合x + 0.5 的语句
x>5
x<6
x可能是实数
*/
string str[59];
string X;
double num[59];
int main()
{
//freopen("date.in","r",stdin);
int n;
scanf("%d",&n);
for(int i = 0; i<n; i++)
{
cin>>X>>str[i]>>num[i];
}
int ans = -1;
for(double y = -2; y<=1009; y+=0.5)
{
int sum = 0;
for(int i = 0; i<n; i++)
{
bool ok = false;
if(str[i]=="=")
ok = (y == num[i]);
else if(str[i]=="<")
ok = (y < num[i]);
else if(str[i]==">")
ok = (y > num[i]);
else if(str[i]=="<=")
ok = (y <= num[i]);
else if(str[i]==">=")
ok = (y >= num[i]);
if(ok) sum++;
}
ans = max(ans,sum);
}
cout<<ans<<endl;
return 0;
}