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

#define all(x) begin(x), end(x)
#ifdef CKISEKI
#define safe cerr << __PRETTY_FUNCTION__ << " line " << __LINE__ << " safe\n"
#define debug(a...) debug_(#a, a)
#define orange(a...) orange_(#a, a)
#include <experimental/iterator>
void debug_(auto s, auto ...a) {
  cerr << "\e[1;32m(" << s << ") = (";
  int f = 0;
  (..., (cerr << (f++ ? ", " : "") << a));
  cerr << ")\e[0m\n";
}
void orange_(auto s, auto L, auto R) {
  cerr << "\e[1;33m[ " << s << " ] = [ ";
  using namespace experimental;
  copy(L, R, make_ostream_joiner(cerr, ", "));
  cerr << " ]\e[0m\n";
}
#else
#define safe ((void)0)
#define debug(...) safe
#define orange(...) safe
#endif

using lld = int64_t;
using P = complex<lld>;
#define IM imag
#define RE real

int sgn(lld x) {
  return (x > 0) - (x < 0);
}

lld cross(P a, P b) {
  return IM(conj(a) * b);
}

int ori(P a, P b, P c) {
  return sgn(cross(b - a, c - a));
}

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int n;
  cin >> n;
  array<int, 26> c = {};
  vector<P> a;
  for (int i = 0; i < n; ++i) {
    int x, y; string s;
    cin >> x >> y >> s;
    c[s[0] - 'a']++;
    a.emplace_back(x, y);
  }
  bool all01 = true;
  for (int i = 0; i < 26; ++i)
    all01 &= c[i] <= 1;
  if (all01) {
    cout << "1\n";
    return 0;
  }
  bool allsame = true;
  for (int i = 2; i < n; ++i) {
    allsame &= (cross(a[i] - a[0], a[1] - a[0]) == 0);
  }
  if (allsame) {
    cout << "2\n";
  } else {
    cout << "Infinity\n";
  }
  return 0;
}