#include<bits/stdc++.h>
#define ll long long 
#define N 105
using namespace std;
string val[N];
struct vec{
    int x,y;
}p[N];
vec operator - (const vec &a,const vec &b){
    return (vec){b.x-a.x,b.y-a.y};
}
ll cross(vec a,vec b){
    return 1ll*a.x*b.y-1ll*a.y*b.x;
}
vector<int> v[26];
int cnt[26],ans=1;
void dfs(vec p1,vec p2,vec p3,vec p4,int len){
    ans=max(ans,len);
    for(int i=0;i<26;++i)
        if(v[i].size()>=2){
            if(cross(p1-p[v[i][0]],p2-p1)>0&&cross(p4-p3,p[v[i][1]]-p4)>0)
                dfs(p[v[i][0]],p1,p4,p[v[i][1]],len+2);
            if(cross(p1-p[v[i][1]],p2-p1)>0&&cross(p4-p3,p[v[i][0]]-p4)>0)
                dfs(p[v[i][1]],p1,p4,p[v[i][0]],len+2);
        }
}
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n;
    cin>>n;
    for(int i=1;i<=n;++i){
        cin>>p[i].x>>p[i].y>>val[i];
        ++cnt[val[i][0]-'a'];
        v[val[i][0]-'a'].push_back(i);
    }
    for(int i=0;i<26;++i) if(cnt[i]>2) {
        cout<<"Infinity";
        return 0;
    }
    for(int i=0;i<26;++i){
        for(int j=0;j<v[i].size();++j){
            for(int k=0;k<26;++k)
                if(v[k].size()==2){
                    if(cross(p[v[i][j]]-p[v[k][0]],p[v[k][1]]-p[v[i][j]])>0)
                        dfs(p[v[k][0]],p[v[i][j]],p[v[i][j]],p[v[k][1]],3);
                    if(cross(p[v[i][j]]-p[v[k][1]],p[v[k][0]]-p[v[i][j]])>0)
                        dfs(p[v[k][1]],p[v[i][j]],p[v[i][j]],p[v[k][0]],3);
                }
        }
        if(v[i].size()==2){
            dfs(p[v[i][0]],p[v[i][1]],p[v[i][0]],p[v[i][1]],2);
            dfs(p[v[i][1]],p[v[i][0]],p[v[i][1]],p[v[i][0]],2);
        }
    }
    cout<<ans<<'\n';
    return 0;
}