Fedor and Essay

题意翻译

在你帮助Fedor在«Call of Soldiers 3»这款游戏中找到朋友之后，他完全停止了学习。今天，英语老师让他准备一篇文章。 Fedor并不想准备这篇文章，所以他向Alex寻求帮助。Alex来帮忙并为Fedor写了一篇文章。但Fedor根本不喜欢这篇文章。现在Fedor将使用英语同义词词典来重写文章。 Fedor不想改变文章的含义。因此，他将做的唯一改变是：根据字典中的替换规则，将一个论文中的单词改为它的一个同义词。 Fedor可以多次执行此操作。 因此，Fedor希望得到一篇文章，其中包含尽可能少的字母“R”（样例无关）。如果有多篇论文都有最小数量的“R”，那么他希望得到一个最小长度的论文（论文的长度是其中所有单词长度的总和）。帮助Fedor获得所需的论文。 请注意，在这个问题中，字母的大小写情况无关紧要。例如，如果同义词词典说单词cat可以用单词DOG替换，则允许用单词doG替换单词Cat。

题目描述

After you had helped Fedor to find friends in the «Call of Soldiers 3» game, he stopped studying completely. Today, the English teacher told him to prepare an essay. Fedor didn't want to prepare the essay, so he asked Alex for help. Alex came to help and wrote the essay for Fedor. But Fedor didn't like the essay at all. Now Fedor is going to change the essay using the synonym dictionary of the English language. Fedor does not want to change the meaning of the essay. So the only change he would do: change a word from essay to one of its synonyms, basing on a replacement rule from the dictionary. Fedor may perform this operation any number of times. As a result, Fedor wants to get an essay which contains as little letters «R» (the case doesn't matter) as possible. If there are multiple essays with minimum number of «R»s he wants to get the one with minimum length (length of essay is the sum of the lengths of all the words in it). Help Fedor get the required essay. Please note that in this problem the case of letters doesn't matter. For example, if the synonym dictionary says that word cat can be replaced with word DOG, then it is allowed to replace the word Cat with the word doG.

输入输出格式

输入格式

The first line contains a single integer $ m $ $ (1<=m<=10^{5}) $ — the number of words in the initial essay. The second line contains words of the essay. The words are separated by a single space. It is guaranteed that the total length of the words won't exceed $ 10^{5} $ characters. The next line contains a single integer $ n $ $ (0<=n<=10^{5}) $ — the number of pairs of words in synonym dictionary. The $ i $ -th of the next $ n $ lines contains two space-separated non-empty words $ x_{i} $ and $ y_{i} $ . They mean that word $ x_{i} $ can be replaced with word $ y_{i} $ (but not vise versa). It is guaranteed that the total length of all pairs of synonyms doesn't exceed $ 5·10^{5} $ characters. All the words at input can only consist of uppercase and lowercase letters of the English alphabet.

输出格式

Print two integers — the minimum number of letters «R» in an optimal essay and the minimum length of an optimal essay.

输入输出样例

输入样例 #1

3
AbRb r Zz
4
xR abRb
aA xr
zz Z
xr y

输出样例 #1

2 6

输入样例 #2

2
RuruRu fedya
1
ruruRU fedor

输出样例 #2

1 10