## Algorithm

A. Indian Summer
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

Indian summer is such a beautiful time of the year! A girl named Alyona is walking in the forest and picking a bouquet from fallen leaves. Alyona is very choosy — she doesn't take a leaf if it matches the color and the species of the tree of one of the leaves she already has. Find out how many leaves Alyona has picked.

Input

The first line contains an integer n (1 ≤ n ≤ 100) — the number of leaves Alyona has found. The next n lines contain the leaves' descriptions. Each leaf is characterized by the species of the tree it has fallen from and by the color. The species of the trees and colors are given in names, consisting of no more than 10 lowercase Latin letters. A name can not be an empty string. The species of a tree and the color are given in each line separated by a space.

Output

Output the single number — the number of Alyona's leaves.

Examples
input
Copy
`5birch yellowmaple redbirch yellowmaple yellowmaple green`
output
Copy
`4`
input
Copy
`3oak yellowoak yellowoak yellow`
output
Copy
`1`

## Code Examples

### #1 Code Example with C++ Programming

```Code - C++ Programming```

``````#include <cstdio>
#include <iostream>
#include <string>
#include <set>

int main(){

int n; std::cin >> n;
std::set<std::pair<std::string, std::string> > leaves;
while(n--){
std::string s1, s2; std::cin >> s1 >> s2;
leaves.insert(std::pair<std::string, std::string>(s1, s2));
}

std::cout << leaves.size() << std::endl;

return 0;
}``````
Copy The Code &

Input

cmd
5
birch yellow
maple red
birch yellow
maple yellow
maple green

Output

cmd
4