#include <iostream>

 #include <cstdio>

 #include <cstring>

 #include <cstdlib>

 #include <cmath>

 #include <algorithm>

 #include <string>

 #include <queue>

 #include <stack>

 #include <vector>

 #include <map>

 #include <set>

 #include <functional>

 #include <cctype>

 #include <time.h>

 using namespace std;

 typedef __int64 ll;

 const int INF = <<;

 const int MAXN = 1e5+;

 const int MAXM = ;

 const ll MOD = ;

 int cnt[MAXM];

 ll dp[][MAXM];

 ll fact[MAXN], inv[MAXN];

 int n;

 ll myPow(ll x, int d) {

     ll res = ;

     while (d>) {

         if (d&) res = (res*x)%MOD;

         x = (x*x)%MOD;

         d >>= ;

     }

     return res;

 }

 inline ll C(int x, int y) {

     return ((fact[x]*inv[y])%MOD * inv[x-y])%MOD;

 }

 inline int lowBit(int x) {

     return x&(-x);

 }

 void solve() {

     int sum = n;

     for (int i = ; i < ; i++) sum -= cnt[<<i];

     memset(dp, , sizeof(dp));

     for (int j = min(, cnt[]); j >= ; j--) dp[][j] = C(cnt[], j);

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

         int cc = >>i;

         for (int k = min(cc, cnt[<<i]); k >= ; k--) { //选k个

             ll CC = C(cnt[<<i], k);

             for (int j = k; j <= cc; j++) { //

                 dp[i][j] = (dp[i][j] + (((dp[i-][(j-k)<<]+dp[i-][(j-k)<<|])%MOD)*CC)%MOD )%MOD;

             }

         }

     }

     ll ans = ((myPow(, n-sum)-dp[][])%MOD+MOD)%MOD;

     ans = (ans*myPow(, sum))%MOD;

     printf("%I64d\n", ans);

 }

 int main() {

     #ifdef Phantom01

         freopen("HDU4945.txt", "r", stdin);

     #endif //Phantom01

     fact[] = ;

     for (int i = ; i < MAXN; i++) fact[i] = (fact[i-]*i)%MOD;

     inv[MAXN-] = myPow(fact[MAXN-], MOD-);

     for (int i = MAXN-; i > ; i--) inv[i-] = (inv[i]*i)%MOD;

     int T = ;

     while (scanf("%d", &n)!=EOF && n!=) {

         printf("Case #%d: ", T++);

         memset(cnt, , sizeof(cnt));

         int x;

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

             scanf("%d", &x);

             cnt[x]++;

         }

         solve();

     }

     return ;

 }