Finding runs ------------ Politicians like to claim that their policies result in economic improvement. Your finance minister wants to demonstrate this by looking at a stock market index at the end of each day and finding out the longest number of consecutive days during which the stock index was non-decreasing. You are asked to write a program for him to find this number. To simplify the problem we assume that the data is given for at most 1000 consecutive days (ignore the fact that stock indices are usually not calculated on weekends and holidays). The stock index values are all positive integers, no more than 10000. Input ----- The input format is as follows. The first line of input contains a single integer c corresponding to the number of cases or instances of the problem. The next c lines each start with an integer n corresponding to the number of days for which the stock index data is given, followed by n integers corresponding to the stock index values for n days. Output ------ For each case your program should output a line that looks like "Case i: " Sample input ------------ 4 4 1 2 3 4 5 2 1 1 2 3 3 1 1 1 7 2 3 2 4 5 6 7 Sample output ------------ Case 1: 4 Case 2: 4 Case 3: 3 Case 4: 5