Elise is the Spider Queen. She has a skill, Spider Form(蜘蛛形态).

When she transformed to the spider, there will be some small spiders around her.

But she has a problem - the small spiders will have infighting because of less common interest. So Elise decided to train their interesting.

At least, they must have common interest no matter directly or indirectly.

How to train theirs interest in least cost? We assume that train a interest for a spider cost 1 strength and there are at most 100 interests in total.

This problem contains several cases.
The first line of each case is an integer N (1 ≤ N ≤ 100), indicates the number of spiders.
Then N lines followed.
The ith line contains an integer Ti (0 ≤ Ti ≤ 100) that indicates the number of this spider's interest and Ti strings indicate the interests. You can assume there are only lowercase letters in the strings and no longer than 20.

For each case, you should output the least cost.