#include "bits/stdc++.h"
using namespace std;

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x...)
#endif

using ll = long long;
using db = long double;

bool cross(pair<int, int> a, pair<int, int> b) {
    return (ll)a.first * b.first + (ll)a.second * b.second > 0;
}

bool on_line(pair<int, int> a, pair<int, int> b, pair<int, int> c) {
    pair<int, int> ab = {b.first - a.first, b.second - a.second};
    pair<int, int> ac = {c.first - a.first, c.second - a.second};
    return (ll)ab.first * ac.second - (ll)ab.second * ac.first == 0;
}

void solve() {
    int n;
    cin >> n;
    vector<pair<pair<int, int>, char>> v(n);
    for (int i = 0; i < n; i++) {
        cin >> v[i].first.first >> v[i].first.second >> v[i].second;
    }
    bool f = false;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (i == j) continue;
            if (v[i].second == v[j].second) f = true;
            for (int k = 0; k < n; k++) {
                if (i == k || j == k) continue;
                if (v[i].second != v[k].second) continue;
                if (on_line(v[i].first, v[j].first, v[k].first)) continue;
                if (cross(v[i].first, v[j].first) && cross(v[j].first, v[k].first) && cross(v[k].first, v[i].first)) {
                    cout << "Infinity";
                    return;
                }
            }
        }
    }
    if (f) {
        cout << 2;
    } else {
        cout << 1;
    }
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    int tests = 1;
    // cin >> tests;
    while (tests--) {
        solve();
    }
    return 0;
}