#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100 + 1;
struct barg {
  string x, y;
} a[MAXN];
int n;
bool f(barg x, barg y) {
  if (x.x != y.x)
    return x.x < y.x;
  else
    return x.y < y.y;
}
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> a[i].x >> a[i].y;
  sort(a + 1, a + n + 1, f);
  int ans = 0;
  for (int i = 1; i <= n; i++)
    if (a[i].x != a[i - 1].x || a[i].y != a[i - 1].y) ans++;
  cout << ans << endl;
}
