#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>

#define BUF 12

void sort(long long int *array, long long int left, long long int right) {
  if (left >= right) return;
  long long int pivot = array[left];
  long long int p_l = left + 1, p_r = right;
  while (p_l <= p_r) {
    while (array[p_l] <= pivot && p_l < right) p_l++;
    while (array[p_r] >= pivot && p_r > left) p_r--;
    if (p_l < p_r) {
      long long int tmp = array[p_l];
      array[p_l] = array[p_r];
      array[p_r] = tmp;
      p_l++;
      p_r--;
    }
  }

  long long int tmp = array[left];
  array[left] = array[p_r];
  array[p_r] = tmp;

  sort(array, left, p_r);
  sort(array, p_r + 1, right);
}

int main(void) {
  long long int n;
  scanf("%lld", &n);
  long long int score[n];
  for (long long int i = 0; i < n; i++) {
    char tmp[BUF];
    memset(tmp, '\0', BUF);
    scanf(" %s", tmp);

    long long int times = 1;
    int strlen = strnlen(tmp, BUF);
    score[i] = 0;
    for (int j = 0; j < strlen; j++) {
      score[i] += tmp[strlen - j - 1] * times;
      times *= 100;
    } 
    // printf("%lld\n", score[i]);
  }

  sort(score, 0, n - 1);

  long long int count = 0;
  for (long long int i = 0; i < n; i++) {
    // printf("%lld\n", score[i]);
    if (!i && !score[i]) count++;
    else if (score[i] != score[i - 1]) count++;
  }
  printf("%lld\n", count);

  return 0;
}
