#include <cstdio>

#include <iostream>

#include <algorithm>

#include <cstring>

#include <iostream>

#include <cmath>

#include <stack>

#include <queue>

#include <vector>

#include <bitset>

#define MM(a,b) memset(a,b,sizeof(a));

#define inf 0x3f3f3f3f

using namespace std;

typedef long long ll;

#define CT continue

#define SC scanf

const int N=3*1e5+10;

const int mod=1e9+7;

int L[2*N],R[2*N],dep[2*N],cnt;

bool flag[2*N];

bitset<32> bit_ip;

void init()

{

    cnt=0;

    MM(L,-1);

    MM(R,-1);

    MM(flag,0);

    bit_ip.reset();

}

void tree_insert(ll ip,ll deep)

{

    bit_ip=ip;

    int cur=0;

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

        if(bit_ip[31-i]){

            if(R[cur]==-1) R[cur]=++cnt;

            cur=R[cur];

        }

        else{

            if(L[cur]==-1) L[cur]=++cnt;

            cur=L[cur];

        }

    }

    flag[cur]=1;

}

struct node{

   bitset<32> bit_ip;int deep;

};

vector<node> ans;

void dfs(int u,int deep)

{

    if(u==-1){

        ans.push_back((node){bit_ip,deep});

        return;

    }

    if(flag[u]) return;

    bit_ip[31-(deep+1)]=1;

    dfs(R[u],deep+1);

    bit_ip[31-(deep+1)]=0;

    dfs(L[u],deep+1);

}

int main()

{

    int cas,n,kk=0;

    SC("%d",&cas);

    while(cas--){

        SC("%d",&n);

        if(!n) {

            printf("Case #%d:\n1\n",++kk);

            printf("0.0.0.0/0\n");CT;

        }

        init();

        int p[6],deep=0;

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

            SC("%d.%d.%d.%d/%d",&p[1],&p[2],&p[3],&p[4],&deep);

            ll ip=p[1];

            for(int i=2;i<=4;i++) ip=(ip<<8)+p[i];

            tree_insert(ip,deep);

        }

        bit_ip=0;

        ans.clear();

        dfs(0,-1);

        printf("Case #%d:\n%d\n",++kk,ans.size());

        for(int i=0;i<ans.size();i++){

            node u=ans[i];

            bitset<32> u_ip=u.bit_ip;

            for(int i=3;i>=0;i--){

                ll tmp=0;

                for(int j=7;j>=0;j--) tmp=(tmp<<1)+u_ip[i*8+j];

                printf("%lld",tmp);

                if(i) printf(".");

            }

            printf("/%d\n",u.deep+1);

        }

    }

    return 0;

}