#include <iostream> using namespace std; int a[100005], b[100005]; int main() { int t, n, c = 0, l, r, mid; cin >> t; int s = t; while (t--) { cin >> n; for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 1; i <= n; i++) { if (a[i] > b[c]) { c++; b[c] = a[i]; } else { l = 1; r = c; while (l < r) { mid = (l + r) / 2; if (a[i] <= b[mid]) r = mid; else l = mid + 1; } b[l] = a[i]; } } cout << "Case #" << s - t << ":" << endl << n - c << endl; } return 0; }