#include <cstdio>

 #include <cstring>

 #include <iostream>

 #define LL long long

 using namespace std ;

 LL dp[][] ,n,x,y,z,t,ans;

 int main()

 {

     int T ,casee = ;

     scanf("%d",&T) ;

     while(T--)

     {

         memset(dp,,sizeof(dp)) ;

         scanf("%I64d %I64d %I64d %I64d %I64d",&n,&x,&y,&z,&t) ;

         ans = n * t * x ;

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

         {

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

             {

                 if( !j ) dp[i][j] = dp[i-][j] + t*(i--j) * y ;

                 else dp[i][j] = max(dp[i-][j-]+(i-j)*y*(t+(j-)*z),dp[i-][j]+(i--j)*y*(t+j*z)) ;

                 ans = max(ans,dp[i][j] + (n-i)*(j * z + t)*(x+(i-j)*y)) ;

             }

         }

         printf("Case #%d: %I64d\n",casee ++ ,ans) ;

     }

     return  ;

 }