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

#define ff  first
#define ss  second
#define pb  push_back

const int N = (1e5 + 5) * 50;
const int mod = 1e9 + 7;
const int oo = N + 5;

typedef pair<int,int>   pii;
typedef long long    ll;


struct pt {
  ll x,y;
  pt(){}
  pt(ll a , ll b): x(a), y(b){}

  pt operator - (const pt &q ) const {
    return {x - q.x , y - q.y };
  }
};

ll cross (pt a, pt b) {
  return a.x * b.y - a.y * b.x;
}

int main() {
  #ifdef LOCAL
  freopen("input.txt","r",stdin);
  #endif // LOCAL

  ios_base::sync_with_stdio(0);
  cin.tie(0); cout.tie(0);

  int n; cin >> n;

  if (n == 1) { 
    cout << 1 << '\n';
    return 0;
  }

  set <char> cur;
  int dup = 0;

  vector <pt> a;

  for (int i = 0; i < n; ++i) {
    int x, y; cin >> x >> y;
    a.pb({x, y});
    char c; cin >> c;
    if (cur.count (c)) dup = 1;
    cur.insert(c);
  }

  int coli = 1;
  for (int i = 2; i < n; i++) { 
    if (cross(a[i] - a[0], a[1] - a[0]) != 0) 
      coli = 0;
  }

  if (!coli && dup) cout << "Infinity\n";
  else cout << "2\n";

  return 0;
}