CITY2  A Famous City
After Mr. B arrived in Warsaw, he was shocked by the skyscrapers and took several photos. But now when he looks at these photos, he finds in surprise that he isn't even able to point out the number of buildings in it. So he decides to work it out as follows:
 divide the photo into n vertical pieces from left to right. The buildings in the photo can be treated as rectangles, the lower edge of which is the horizon. One building may span several consecutive pieces, but each piece can only contain one visible building, or no buildings at all.
 measure the height of each building in that piece.
 write a program to calculate the minimum number of buildings.
Mr. B has finished the first two steps, the remaining comes to you.
Input
Each test case starts with a line containing an integer n (1 <= n <= 100,000). Following this is a line containing n integers  the height of building in each piece respectively. Note that zero height means there are no buildings in this piece at all. All the input numbers will be nonnegative and less than 1,000,000,000.
Output
For each test case, display a single line containing the case number and the minimum possible number of buildings in the photo.
Example
Input: 3 1 2 3 3 1 2 1 Output: Case 1: 3 Case 2: 2
Explanation
The possible configurations of the samples are illustrated below:
hide comments
phoemur:
20181123 23:15:35
In the case


Abhimanyu:
20151225 16:17:41
most vague problem description ever. 

Utkarsh Rastogi:
20150111 09:56:19
Good problem....testcases are really helpful.. :) 

Hasil Sharma:
20140622 15:18:33
Nice Problem :) 

:
20130430 04:09:35
Last edit: 20140227 07:48:40 

abdou_93:
20130429 19:11:55


abdelkarim:
20130429 12:01:12
nice one ! 

Vikas Kushwaha:
20121228 09:40:10
easy but good one. :) 

kamalesh:
20121226 14:36:51
thanks Runtime Error!!!! 

Swapnil R.Mehta:
20121222 18:18:29
Take care of:

Added by:  Fudan University Problem Setters 
Date:  20120525 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 
Resource:  FDU Local Contest 2012 