#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 505;

struct point{
    int x,y;
    point (int _x = 0,int _y = 0) : x(_x), y(_y) {}
};
point operator - (const point &p1,const point &p2){
    return point(p1.x - p2.x,p1.y - p2.y);
}

ll det(point p1,point p2){
    return 1ll * p1.x * p2.y - 1ll * p2.x * p1.y;
}

int n;
point p[N];
char ch[N];

void solve(){
    cin >> n;
    for(int i = 1;i <= n;i ++){
        cin >> p[i].x >> p[i].y >> ch[i];
    }
    int ans = 1;
    for(int i = 1;i <= n;i ++){
        for(int j = i + 1;j <= n;j ++){
            if(ch[i] == ch[j]) ans = 2;
        }
    }
    for(int i = 1;i <= n;i ++){
        for(int j = 1;j <= n;j ++){
            for(int k = 1;k <= n;k ++){
                if(i == j || j == k) continue;
                if(ch[i] == ch[k] && det(p[j] - p[i],p[k] - p[j]) > 0 && det(p[k] - p[j],p[i] - p[k]) > 0 && det(p[i] - p[k],p[j] - p[i]) > 0) ans = 3;
            }
        }
    }
    if(ans > 2) cout << "Infinity\n";
    else cout << ans << '\n';
}

int main(){
    ios::sync_with_stdio(false);
    solve();
    return 0;
}