You must know that our country is well known for its strange <em>holidays</em> system. We celebrate anything we can, and often new public <em>holidays</em> are announced, though sometimes some are cancelled.nnIn year 3141 some archeologists have discovered the document that they consider to be the log of changes in the system of public <em>holidays</em> in our country from year Ys till year Yf , inclusively. Each record of the document has the formnn, added norn, removed nThe record of the first type means that the public holiday on was announced on day , and the record of the second type means that the public holiday on was cancelled on day .nnUnfortunately, all dates of records only include day and month, but not the year. Now the archeologists wonder, what maximal number of public <em>holidays</em> could have been there during the years described. Your task in this problem is to answer this question and provide the version of the document with years inserted, that would guarantee this number of the <em>holidays</em>.nnYou must assume that all records in the document are in the chronological order and that there were no day when two different events took place, that is, all dates of records in the document must be different.nnNote that if the holiday was announced on its own day, the year it is announced there is no public holiday on this date. Analogously, if the holiday is cancelled on its own day, there is still the holiday this year (so people do not have to go to work after listening to morning radio programs).nnAlso recall, that the day of February 29 exists only in leap years, that is, years that are divisible by 4, except those divisible by 100, except those divisible by 400. For example, years 1996, 2000 and 2004 are leap, while 1999 or 2100 are not.nnnInputnnInput contains multiple test cases. The first line of the input is a single integer T (1 <= 100). Next n lines contain the the document records, one on a line. See sample input for more detailed information.nnYou must not consider any other <em>holidays</em> except those explicitly specified in the document. You may assume that no holiday is removed before it is announced.nnnOutputnnOn the first line of each case print the maximal number of public <em>holidays</em> for the given period. After that print n lines - the version of the document with years inserted that provides the specified number of <em>holidays</em>. Adhere to the format of the sample output.nnTwo consecutive cases should be separated by a single blank line. No blank line should be produced after the last test case.nnIf it is impossible to interpret the document in the specified way, print -1 on the first and the only line of the output file.nnnSample Inputnn2nn1900 1999n9nJanuary 1, added January 1nJanuary 1, added January 7nFebruary 29, added February 29nNovember 7, added November 7nNovember 7, removed January 7nSeptember 1, added May 1nAugust 21, removed November 7nSeptember 1, added June 12nSeptember 1, added December 12nn1900 1900n2nMay 1, added May 1nApril 1, removed May 1nnSample Outputnn406nJanuary 1 1900, added January 1nJanuary 1 1901, added January 7nFebruary 29 1904, added February 29nNovember 7 1904, added November 7nNovember 7 1905, removed January 7nSeptember 1 1906, added May 1nAugust 21 1907, removed November 7nSeptember 1 1907, added June 12nSeptember 1 1908, added December 12nn-1
《the c programming language》<em>第一</em><em>单元</em>课本代码
《the c programming language》<em>第一</em><em>单元</em>课本代码《the c programming language》<em>第一</em><em>单元</em>课本代码《the c programming language》<em>第一</em><em>单元</em>课本代码《the c programming language》<em>第一</em><em>单元</em>课本代码
The MKS system is also in common use.
One of the most valuable ways of representing functions is by graphical representation.
This digital computer is for laboratory use.
The root is between 0.23 and 0.24.
These controllers are not without other disadvantages.
The usefulness of logarithms in advanced mathematics remains of great importance.