#include <bits/stdc++.h>
#define fr first
#define sc second
#define all(a) (a).begin(), (a).end()
#define unique(a) a.resize(unique(a.begin(), a.end()) - a.begin())

using namespace std;

#ifdef ONPC
mt19937 rnd(223);
#else
mt19937 rnd(chrono::high_resolution_clock::now()
			.time_since_epoch().count());
#endif

#define TIME (clock() * 1.0 / CLOCKS_PER_SEC)

using ll = long long;
using ld = double;

const int maxn = 1e5 + 100, inf = 1e9 + 100;

pair<int, int> dif(pair<int, int> a, pair<int, int> b) {
    return {b.fr - a.fr, b.sc - a.sc};
}

ll cross(pair<int, int> a, pair<int, int> b) {
    return a.fr * (ll)b.sc - a.sc * (ll)b.fr;
}

void solve() {
    int n;
    cin >> n;
    vector<pair<int, int>> pt(n);
    vector<char> c(n);
    for (int i = 0; i < n; i++) {
        cin >> pt[i].fr >> pt[i].sc >> c[i];
    }
    for (int i = 0; i < n; i++)
        for (int j = 0; j < n; j++)
            for (int k = 0; k < n; k++)
                if (i != k && i != j && j != k && c[i] == c[k] && cross(dif(pt[i], pt[j]), dif(pt[j], pt[k])) > 0) {
                    cout << "Infinity\n";
                    return;
                }
    cout << min(n, 2) << '\n';
}

int main() {
#ifdef ONPC
    freopen("../a.in", "r", stdin);
//    freopen("../a.out", "w", stdout);
#endif
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout << fixed;
    cout.precision(20);
    solve();
    cerr << "\n\nConsumed " << TIME << endl;
}