#define LOCAL
#include <bits/stdc++.h>
#define fir first
#define sec second
#define el '\n'

#ifdef LOCAL
#define FINISH cerr << "FINISH" << endl;
#else
#define FINISH ;
#endif

#ifdef LOCAL
#define debug(x) cerr << setw(4) << #x << " == " << x << endl
#else
#define debug(x)
#endif

#ifdef LOCAL
#define debugv(x)                   \
	cerr << setw(4) << #x << ":: "; \
	for (auto i : x)                \
		cerr << i << " ";           \
	cerr << endl
#else
#define debugv(x)
#endif

using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
ostream& operator<<(ostream& out, PII& x)
{
	out << x.fir << " " << x.sec << endl;
	return out;
}

const int mod = 998244353;
const int inf = 0x3f3f3f3f;
const int N = 200020;
ll cross(PII x, PII y)
{
	return 1ll * x.fir * y.sec - 1ll * x.sec * y.fir;
}
bool judge(PII x, PII y, PII z)
{
	PII res1 = {x.fir - y.fir, x.sec - y.sec};
	PII res2 = {y.fir - z.fir, y.sec - z.sec};
	return cross(res1, res2) == 0ll;
}
void solve()
{
	int n;
	cin >> n;
	vector<PII> a(n + 1);
	vector<char> ch(n + 1);
	map<int, int> mp;
	for (int i = 1; i <= n; i++) {
		cin >> a[i].fir >> a[i].sec;
		cin >> ch[i];
		mp[ch[i]] = 1;
	}
	if (mp.size() == n) {
		cout << "1" << endl;
		return;
	}
	int ans = 2;
	for (int i = 1; i <= n; i++) {
		for (int j = i + 1; j <= n; j++) {
			if (ch[j] != ch[i])
				continue;
			for (int k = 1; k <= n; k++) {
				if (k == i || k == j)
					continue;
				if (ch[i] == ch[k]) {
					if (!judge(a[i], a[j], a[k])) {	 // 判断三点共线
						cout << "Infinity" << endl;
						return;
					}
				}
				else {
					if (!judge(a[i], a[j], a[k])) {	 // 判断三点共线
						ans = 3;
					}
				}
			}

			for (int k = 1; k <= n; k++) {
				if (k == i || k == j)
					continue;
				for (int l = 1; l <= n; l++) {
					if (l == i || l == j || l == k)
						continue;
					if (!judge(a[i], a[j], a[k]) ||
						!judge(a[i], a[j], a[l])) {	 // 判断三点共线
						cout << "Infinity" << endl;
						return;
					}
				}
			}
		}
	}
	cout << ans << endl;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	int T = 1;
	// cin >> T;
	while (T--) {
		solve();
	}
	return 0;
}