#include<bits/stdc++.h>
#define Yukinoshita namespace
#define Yukino std
using Yukinoshita Yukino;
int read()
{
	int s=0,w=1;
	char ch=getchar();
	while(ch<'0'||ch>'9') w=ch=='-'?-1:1,ch=getchar();
	while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
	return s*w;
}
const int mxn=3005;
int x[mxn],y[mxn];
vector<int> e[mxn];
int cnt[mxn];
bool vis[mxn];
char v[mxn];
int dfs(int d)
{
//	cout<<d<<' '<<e[d].size()<<endl;
	vis[d]=1;
	while(cnt[d]<e[d].size()&&vis[e[d][cnt[d]]]) cnt[d]++;
	if(cnt[d]==e[d].size()) return 1;
	return dfs(e[d][cnt[d]])+1;
}
bool cmp1(int a,int b)
{
	return x[a]<x[b];
}
bool cmp2(int a,int b)
{
	return x[a]>x[b];
}
bool cmp3(int a,int b)
{
	return y[a]<y[b];
}
bool cmp4(int a,int b)
{
	return y[a]>y[b];
}
int main()
{
	int n=read(),i,j;
	for(i=1;i<=n;i++)
	{
		char s[5];
		y[i]=read(),x[i]=read();
		scanf("%s",s);
		v[i]=*s;
	}	
	for(i=1;i<=n;i++)
	{
		for(j=1;j<=n;j++)
		{
			if(v[i]=='v')
			{
				if(y[i]==y[j]&&x[j]>x[i])
					e[i].push_back(j);
			}
			if(v[i]=='^')
			{
				if(y[i]==y[j]&&x[j]<x[i])
					e[i].push_back(j);
			}
			if(v[i]=='>')
			{
				if(x[i]==x[j]&&y[j]>y[i])
					e[i].push_back(j);
			}
			if(v[i]=='<')
			{
				if(x[i]==x[j]&&y[j]<y[i])
					e[i].push_back(j);
			}
		}
		if(v[i]=='v') sort(e[i].begin(),e[i].end(),cmp1);
		if(v[i]=='^') sort(e[i].begin(),e[i].end(),cmp2);
		if(v[i]=='>') sort(e[i].begin(),e[i].end(),cmp3);
		if(v[i]=='<') sort(e[i].begin(),e[i].end(),cmp4);
	}
	int mx=0;
//	dfs(5);
	for(i=1;i<=n;i++)
		memset(vis,0,sizeof(vis)),memset(cnt,0,sizeof(cnt)),mx=max(mx,dfs(i));
	cout<<mx;
}