In this problem, you are given several strings that contain only digits from ’0’ to ’9’, inclusive. An example is shown below. 101 123 The set S of strings is consists of the N strings given in the input file, and all the possible substrings of each one of them. It’s boring to manipulate strings, so you decide to convert strings in S into integers. You can convert a string that contains only digits into a decimal integer, for example, you can convert “101“ into 101, “01“ into 1, et al. If an integer occurs multiple times, you only keep one of them. For example, in the example shown above, all the integers are 1, 10, 101, 2, 3, 12, 23, 123. Your task is to calculate the remainder of the sum of all the integers you get divided by 2012. Input There are no more than 20 test cases. The test case starts by a line contains an positive integer N. Next N lines each contains a string consists of one or more digits. It’s guaranteed that 1 ≤ N ≤ 10000 and the sum of the length of all the strings ≤ 100000. The input is terminated by EOF. Output An integer between 0 and 2011, inclusive, for each test case. Sample Input 5 101 123 09 000 1234567890 Sample Output 202