#include <bits/stdc++.h>
#include <bits/extc++.h> 
using namespace std;

#define rep(i, l, r) for (int i = l; i < (int)(r); i++)
#define rrep(i, l, r) for(int i = (int)(r)-1; i >= (int)(l); i--)
#define all(x) begin(x), end(x)

using ll = long long;
using vi = vector<int>;
using pii = pair<int, int>;

template <typename T1, typename T2>
std::ostream& operator<<(std::ostream& os, const std::pair<T1, T2>& p) {
    os << "(" << p.first << ", " << p.second << ")";
    return os;
}

using pll = pair<ll, ll>;

template<class T1, class T2>
pair<T1, T2> operator+(pair<T1, T2> a, pair<T1, T2> b) {
    return {a.first + b.first, a.second + b.second};
}
template<class T1, class T2>
pair<T1, T2> operator-(pair<T1, T2> a, pair<T1, T2> b) {
    return {a.first - b.first, a.second - b.second};
}

ll det(pll a, pll b, pll c) {
    pll x = b - a, y = c - a;
    return x.first * y.second - x.second * y.first;
}


void solve() {
    std::cin.tie(0)->sync_with_stdio(0);

    int n;cin >> n;
    vector<pair<ll, ll>> p(n);vector<char> c(n);
    rep(i, 0, n) {
        cin >> p[i].first >> p[i].second >> c[i];
    }

    rep(i, 0, n) rep(j, 0, n) rep(k, j+1, n) {
        if (i == j || i == k) continue;
        if (c[j] != c[k]) continue;
        if (det(p[i], p[j], p[k]) != 0) {
            cout << "Infinity" << endl;
            return;
        }
        
    }

    rep(i, 0, n) rep(j, i+1, n) {
        if (c[i] != c[j]) continue;
        cout << 2 << endl;
        return;
    }
    cout << 1 << endl;
    

}

int main() {

    int T = 1;
    while (T--)solve();
}