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

const int N = 105;
int n, x[N], y[N], cc[N];
vector <int> st[N];

bool ok(int a, int b, int c)
{
	return (x[b] - x[a]) * (y[c] - y[b]) - (y[b] - y[a]) * (x[c] = x[b]) > 0;
}
int xj(int a, int b, int c)
{
	return (x[b] - x[a]) * (y[c] - y[b]) - (y[b] - y[a]) * (x[c] = x[b]) > 0;
}

int main()
{
	scanf("%d", &n);
	char ch;
	int mx = 0;
	int cnt[26] = {0};
	for (int i = 1; i <= n; i++)
	{
		scanf("%d%d %c", &x[i], &y[i], &ch);
		cc[i] = ch - 'a';
		cnt[cc[i]]++;
		mx = max(mx, cnt[cc[i]]);
		st[cc[i]].push_back(i);
	}
	if (mx == 1)
	{
		printf("1\n");
		return 0;
	}
	bool rua = false;
	for (int i = 0; i < 26; i++)
	{
		int m = st[i].size();
		for (int a = 0; a < m; a++)
			for (int b = a + 1; b < m; b++)
			{
				for (int c = b + 1; c < m; c++)
					if (xj(st[i][a], st[i][b], st[i][c]))
					{
						printf("Infinity\n");
						return 0;
					}
				for (int c = 1; c <= n; c++)
					if (cc[c] != i && xj(st[i][a], st[i][b], c))
					{
						printf("Infinity\n");
						return 0;
					}
			}
	}
	printf("2\n");
	return 0;
}