#include <iostream>

using namespace std;
typedef long long ll;

const int N = 100 + 3;

ll n;
pair<ll, ll> p[N];
char c[N];

ll cross(pair<ll, ll> a, pair<ll, ll> b){
    return a.first * b.second - b.first * a.second;
}

pair<ll, ll> subtract(pair<ll, ll> a, pair<ll, ll> b){
    return pair{a.first - b.first, a.second - b.second};
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> n;
    for(int i = 0; i < n; ++i)
        cin >> p[i].first >> p[i].second >> c[i];

    if(n <= 2){
        cout << n << "\n";
        return 0;
    }

    bool on_line = true;
    for(int i = 2; i < n; ++i){
        on_line &= !cross(subtract(p[i - 1], p[i - 2]), subtract(p[i], p[i - 2]));
    }

    bool same_c = false;
    for(int i = 0; i < n; ++i){
        for(int j = i + 1; j < n; ++j){
            if(c[i] == c[j]){
                same_c = true;
            }
        }
    }

    if(on_line || !same_c){
        cout << "2\n";
        return 0;
    }

    cout << "Infinity\n";
}