#include<iostream>

 #include<cstdio>

 #include<cstring>

 #include <cmath>

 #include<stack>

 #include<vector>

 #include<map>

 #include<set>

 #include<queue>

 #include<algorithm>

 #define mod=1e9+7;

 using namespace std;

 typedef long long LL;

 const int INF = 0x7fffffff;

 int main(){

     int n,s1,s2,v1,v2,ncase,kase;

     scanf("%d",&ncase);

     for(kase=;kase<=ncase;kase++){

         cin>>n>>s1>>v1>>s2>>v2;

         LL ans=;

         for(LL i=;i<;i++){

             if(i*s1<=n)

             ans=max(ans,(n-i*s1)/s2*v2+i*v1);

             if(i*s2<=n)

             ans=max(ans,(n-i*s2)/s1*v1+i*v2);

         }

         printf("Case #%d: ",kase);

         cout<<ans<<"\n";

     }

     return ;

 }