#include<iostream>
#include<string>
#include<iomanip>
#include<algorithm>
#include<deque>
#include<stack>
#include<queue>
#include<cmath>
#include<vector>
#include<math.h>
#include<set>
#include<map>
using namespace std;
void mansour()
{
std::ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
}
int main()
{
mansour();
/*The First*/
long long t;
cin>>t;
for(int i=1;i<=t;i++)
{
long long n,a[100005],mx=0;
cin>>n;
cin>>a[0];
mx=a[0];
for(int i=1;i<n;i++)
{
cin>>a[i];
mx=max(mx,a[i]-a[i-1]);
}
long long ans=mx;
if(a[0]==mx)
mx--;
for(int i=1;i<n;i++)
{
if(a[i]-a[i-1]==mx)
mx--;
else if(a[i]-a[i-1]>mx)
{
ans++;
break;
}
}
cout <<"Case "<<i<<": "<<ans<<"\n";
}
}
I2luY2x1ZGU8aW9zdHJlYW0+CiNpbmNsdWRlPHN0cmluZz4KI2luY2x1ZGU8aW9tYW5pcD4KI2luY2x1ZGU8YWxnb3JpdGhtPgojaW5jbHVkZTxkZXF1ZT4KI2luY2x1ZGU8c3RhY2s+CiNpbmNsdWRlPHF1ZXVlPgojaW5jbHVkZTxjbWF0aD4KI2luY2x1ZGU8dmVjdG9yPgojaW5jbHVkZTxtYXRoLmg+CiNpbmNsdWRlPHNldD4KI2luY2x1ZGU8bWFwPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwp2b2lkIG1hbnNvdXIoKQp7CglzdGQ6Omlvc19iYXNlOjpzeW5jX3dpdGhfc3RkaW8oMCk7CgljaW4udGllKE5VTEwpOwoJY291dC50aWUoTlVMTCk7Cn0KCmludCBtYWluKCkKewoJbWFuc291cigpOwoJLypUaGUgRmlyc3QqLwoJbG9uZyBsb25nIHQ7CgljaW4+PnQ7Cglmb3IoaW50IGk9MTtpPD10O2krKykKCXsKCQlsb25nIGxvbmcgbixhWzEwMDAwNV0sbXg9MDsKCQljaW4+Pm47CgkJY2luPj5hWzBdOwoJCW14PWFbMF07CgkJZm9yKGludCBpPTE7aTxuO2krKykKCQl7CgkJCWNpbj4+YVtpXTsKCQkJbXg9bWF4KG14LGFbaV0tYVtpLTFdKTsKCQl9CgkJbG9uZyBsb25nIGFucz1teDsKCQlpZihhWzBdPT1teCkKCQkJCW14LS07CgkJZm9yKGludCBpPTE7aTxuO2krKykKCQl7CgkJCWlmKGFbaV0tYVtpLTFdPT1teCkKCQkJCW14LS07CgkJCWVsc2UgaWYoYVtpXS1hW2ktMV0+bXgpCgkJCXsKCQkJCWFucysrOwoJCQkJYnJlYWs7CgkJCX0KCQl9CgkJY291dCA8PCJDYXNlICI8PGk8PCI6ICI8PGFuczw8IlxuIjsKCX0KfQ==