#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define SIZE_TABLE 64

struct _item
{
    char name[10];
    struct _item *next;
};

int hashFunc(char *keyStr)
{
    int sum = 0;
    int i = 0;

    while (keyStr[i] != '\0')
    {
        sum += keyStr[i];
        i++;
    }

    return sum % SIZE_TABLE;
}

int main()
{
    struct _item *roots[SIZE_TABLE];

    for (int i = 0; i < SIZE_TABLE; i++)
    {
        roots[i] = NULL;
    }

    int N;
    int count=0;

    scanf("%d", &N);

    char s[10];

    scanf("%s", s);
    struct _item *item = malloc(sizeof(struct _item));
    strcpy(item->name, s);
    item->next = NULL;
    roots[hashFunc(s)] = item;
    count++;

    for (int i = 0; i < N - 1; i++)
    {
        scanf("%s", s);

        int hash_n = hashFunc(s);
        if (roots[hash_n] == NULL)
        {
            struct _item *item = malloc(sizeof(struct _item));
            strcpy(item->name, s);
            item->next = NULL;
            roots[hash_n] = item;
            count++;
        }
        else
        {
            for (struct _item *tmp = roots[hash_n]; tmp != NULL; tmp = tmp->next)
            {
                if (strcmp(tmp->name, s) == 0)
                {
                    break;
                }
                if (tmp->next == NULL)
                {
                    struct _item *item = malloc(sizeof(struct _item));
                    strcpy(item->name, s);
                    item->next = NULL;
                    tmp->next = item;
                    count++;
                    break;
                }
            }
        }
    }

    printf("%d", count);

    return 0;
}