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

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

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

  using P = pair<ll, ll>;
  int n;
  cin >> n;
  vector<P> pts(n);
  vector<char> label(n);
  vector<int> c(26);
  rep(i, 0, n) {
	  cin >> pts[i].first >> pts[i].second >> label[i];
	  c[label[i] - 'a']++;
  }
  auto cross = [&](P& a, P& b)->ll {
	  return a.first*b.second - b.first * a.second;
  };
  rep(i, 0, n) {
	  rep(j, 0, n) {
		  if (i == j) continue;
		  auto P = make_pair(pts[j].first - pts[i].first, pts[j].second - pts[i].second);
		  rep(k, 0, n) {
			  if (i == k || j == k) continue;
			  auto Q = make_pair(pts[k].first - pts[j].first, pts[k].second - pts[j].second);
			  if (label[i] == label[k]) {
				  if (cross(P, Q) > 0) {
					  cout << "Infinity\n";
					  return 0;
				  }
			  }

			  if (label[j] == label[k]) {
				  rep(l, 0, n) {
					  if (i == l || j== l || k == l) continue;
					  if (label[i] != label[l]) continue;
					  auto R = make_pair(pts[l].first - pts[k].first, pts[l].second - pts[k].second);
					  if (cross(P, Q) > 0 && cross(Q, R) > 0) {
						  cout << "Infinity\n";
						  return 0;
					  }
				  }
			  }
		  }
	  }
  }
  rep(i, 0, 26) {
	  if (c[i] >= 2) {
		  cout << 2 << '\n';
		  return 0;
	  }
  }
  cout << 1 << '\n';
}