{"trustable":false,"sections":[{"title":"","value":{"format":"HTML","content":"\u003cp\u003e \u0026nbsp;\u003c/p\u003e \n\u003cp\u003e Your little brother has just learnt to write one, two and three, in English. He has written a lot of those words in a paper, your task is to recognize them. Note that your little brother is only a child, so he may make small mistakes: for each word, there might be at most one wrong letter. The word length is always correct. It is guaranteed that each letter he wrote is in lower-case, and each word he wrote has a unique interpretation.\u003c/p\u003e \n\u003cp\u003e \u0026nbsp;\u003c/p\u003e \n\u003ch2\u003e \u003ca\u003e Input\u003c/a\u003e\u0026nbsp;\u003c/h2\u003e \n\u003cp\u003e The first line contains the number of words that your little brother has written. Each of the following lines contains a single word with all letters in lower-case. The words satisfy the constraints above: at most one letter might be wrong, but the word length is always correct. There will be at most 10 words in the input.\u003c/p\u003e \n\u003cp\u003e \u0026nbsp;\u003c/p\u003e \n\u003ch2\u003e \u003ca\u003e Output\u003c/a\u003e\u0026nbsp;\u003c/h2\u003e \n\u003cp\u003e For each test case, print the numerical value of the word.\u003c/p\u003e \n\u003cp\u003e \u0026nbsp;\u003c/p\u003e \n\u003ch2\u003e \u003ca\u003e Sample Input\u003c/a\u003e\u0026nbsp;\u003c/h2\u003e \n\u003cp\u003e \u0026nbsp;\u003c/p\u003e \n\u003cpre\u003e\r\n3\r\nowe\r\ntoo\r\ntheee\r\n\u003c/pre\u003e \n\u003cp\u003e \u0026nbsp;\u003c/p\u003e \n\u003ch2\u003e \u003ca\u003e Sample Output\u003c/a\u003e\u0026nbsp;\u003c/h2\u003e \n\u003cp\u003e \u0026nbsp;\u003c/p\u003e \n\u003cpre\u003e\r\n1\r\n2\r\n3\r\n\u003c/pre\u003e \n\u003cp\u003e \u0026nbsp;\u003c/p\u003e \n\u003cp\u003e \u0026nbsp;\u003c/p\u003e \n\u003cp\u003e The Seventh Hunan Collegiate Programming Contest\u003cbr /\u003e Problemsetter: Rujia Liu, Special Thanks: Yiming Li \u0026amp; Jane Alam Jan\u003c/p\u003e"}}]}