//#pragma comment(linker, "/STACK:167772160")//手动扩栈~~~~hdu 用c++交

 #include<cstdio>

 #include<cstring>

 #include<cstdlib>

 #include<iostream>

 #include<queue>

 #include<stack>

 #include<cmath>

 #include<set>

 #include<algorithm>

 #include<vector>

 // #include<malloc.h>

 using namespace std;

 #define clc(a,b) memset(a,b,sizeof(a))

 #define LL long long

 const int Inf = 0x3f3f3f3f;

 const double eps = 1e-;

 const double pi = acos(-);

 // inline int r(){

 //     int x=0,f=1;char ch=getchar();

 //     while(ch>'9'||ch<'0'){if(ch=='-') f=-1;ch=getchar();}

 //     while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}

 //     return x*f;

 // }

 int a[];

 int dp[][];

 int main(){

     int t;

     int cas=;

     scanf("%d",&t);

     while(t--){

        clc(dp,);

        int n;

        scanf("%d",&n);

        for(int i=;i<=n;i++) scanf("%d",&a[i]);

        for(int i=;i<=n;i++)

         for(int j=i;j<=n;j++){

             dp[i][j]=i-j+;

         }

         for(int i=n;i>=;i--){

             for(int j=i;j<=n;j++){

                 dp[i][j]=dp[i+][j]+;

                 for(int k=i;k<=j;k++){

                     if(a[k]==a[i])

                     dp[i][j]=min(dp[i][j],dp[i+][k-]+dp[k][j]);

                 }

             }

         }

         printf("Case %d: %d\n",cas++,dp[][n]);

        }

     return ;

 }