#include <bits/stdc++.h>
#ifdef LOCAL
#include "cp_debug.h"
#else
#define debug(...) 42
#endif
#define rep(i,a,b) for(int i = a; i < b; ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)x.size()
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;

template<typename T> void read(T &x){
    x = 0;char ch = getchar();ll f = 1;
    while(!isdigit(ch)){if(ch == '-')f*=-1;ch=getchar();}
    while(isdigit(ch)){x = x*10+ch-48;ch=getchar();}x*=f;
}
template<typename T, typename... Args> void read(T &first, Args& ... args) {
    read(first);
    read(args...);
}
template<typename T> void write(T x) {
    if(x > 9) write(x/10);
    putchar(x%10 + '0');
}

void solve() {
    int n;
    read(n);
    vector<tuple<ll,ll,char>> pts(n);
    vector<int> cnt(26);
    for (auto &[x,y,c]: pts) {
        char val[3];
        read(x, y);
        scanf("%s", val);
        c = val[0];
        cnt[c-'a']++;
    }
    if(n <= 2) {
        printf("%d\n", n);
        return;
    }
    if(*max_element(all(cnt)) == 1) {
        puts("2");
    } else {
        bool all_colinear = true;
        auto [ox, oy, oc] = pts[0];
        auto [ix, iy, ic] = pts[1];
        ll bx = ix - ox, by = iy - oy;
        for(int i = 2; i < n; i++) {
            auto [px, py, pc] = pts[i];
            ll ax = px-ox, ay = py-oy;
            debug(ax, by, ay, bx);
            if(ax*by != ay*bx) {
                all_colinear = false;
            }
        }
        if(all_colinear) {
            puts("2");
        } else {
            puts("Infinity");
        }
    }
}
signed main() {
    int T; T = 1;
    while(T--) solve();
    return 0;
}