#include <iostream> #include <algorithm> using namespace std; int map[10005]; int MaxL[10005]; int main() { int cnt = 0; while(1) { scanf("%d", &map[1]); if(map[1] == -1) break; int N = 2; while(scanf("%d", &map[N]) && map[N] != -1) N++; N--; MaxL[1] = 1; for(int i = 2; i <= N; ++i) { int max = 0; for(int j = i-1; j >= 1; --j) if(map[i] <= map[j] && MaxL[j] > max) max = MaxL[j]; MaxL[i] = max + 1; } int max = -1; for(int i = 1; i <= N; ++i) if(MaxL[i] > max) max = MaxL[i]; printf("Test #%d:/n maximum possible interceptions: %d/n/n", ++cnt, max); } return 0; }