Each input file contains one test case. Each case contains a positive integer N (<= 1000), followed by N lines of accounts. Each account consists of a user name and a password, both are strings of no more than 10 characters with no space.
For each test case, first print the number M of accounts that have been modified, then print in the following M lines the modified accounts info, that is, the user names and the corresponding modified passwords. The accounts must be printed in the same order as they are read in. If no account is modified, print in one line "There are N accounts and no account is modified" where N is the total number of accounts. However, if N is one, you must print "There is 1 account and no account is modified" instead.
3<br/>Team000002 Rlsp0dfa<br/>Team000003 perfectpwd<br/>Team000001 R1spOdfa
2<br/>Team000002 RLsp%dfa<br/>Team000001 R@spodfa
暂无题解