hihoCoder挑战赛14 -1223

//作者:1085422276
#include <cstdio>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <set>
#include <vector>
#include <sstream>
#include <queue>
#include <typeinfo>
#include <fstream>
#include<bits/stdc++.h>
#include <map>
#include <stack>
typedef long long ll;
using namespace std;
const int inf = 10000000;
inline ll Read()
{
    ll x=0,f=1;
    char ch=getchar();
    while(ch<‘0‘||ch>‘9‘)
    {
        if(ch==‘-‘)f=-1;
        ch=getchar();
    }
    while(ch>=‘0‘&&ch<=‘9‘)
    {
        x=x*10+ch-‘0‘;
        ch=getchar();
    }
    return x*f;
}
ll exgcd(ll a,ll b,ll &x,ll &y)
{
    ll temp,p;
    if(b==0)
    {
        x=1;
        y=0;
        return a;
    }
    p=exgcd(b,a%b,x,y);
    temp=x;
    x=y;
    y=temp-(a/b)*y;
    return p;
}
//*******************************
#define N 101
int ans=0,a[N],n,s[N];char b[N][20];

int main()
 {
     n=Read();
     for (int i=1;i<=n;i++)
      {
          scanf("%s%s%d",b[i],b[i],&a[i]);
          s[i]=strlen(b[i]);
      }
     for(double  t=-0.5;t<=1004; t+=0.5)
      {
          int k=0;
          for (int i=1;i<=n;i++)
           if ((t==a[i]&&b[i][0]==‘=‘)||(t==a[i]&&s[i]==2&&b[i][1]==‘=‘))
             k++;
             else if (t>a[i]&&b[i][0]==‘>‘) k++;
             else if (t<a[i]&&b[i][0]==‘<‘) k++;
          ans=max(ans,k);
      }
     cout <<ans<<endl;
     return 0;
 }