See input / output section for more details.
输入
The first line contains a single integer n \ (1 \leq n \leq 1000).
The second line contains n integers a_1,a_2,...,a_n \ (1 \leq a_i \leq 10^9), representing array a.
The third line contains n lowercase letters b_1,b_2,...,b_n, representing array b.
The fourth line contains a string s which consists of lowercase letters and spaces. It is guaranteed that the length of s will not exceed 1000.
The fifth line contains a sequence of integers c_1,c_2,c_3,... \ (1 \leq c_i \leq 10^9), terminated by end-of-file, representing array c. It is guaranteed that the length of c will not exceed 1000.
输出
In the first line of the output, print the value of \sum_{i=1}^{n}a_i.
In the second line of the output, if all 26 lowercase letters are presented in array b, output YES. Otherwise output NO.
In the third line of the output, print the length of string s.
In the fourth line of the output, print the length of array c.
样例
| 标准输入 复制文本 |
6 1 1 4 5 1 4 h e h h e h nun heh heh aaaaaaaaaaaaaaaaaaaaaaa 114514 1919810 |
| 标准输出 复制文本 |
16 NO 35 2 |
提示
If you get wrong answer in this problem, there must be an issue with this OJ (doge).