#include <iostream>
#include <map>
#include <set>
#include <cstdio>
#include <cmath>
#include <iterator>
#include <algorithm>
#define ll long long
#define eps 1e-9
#define PI 2 * acos (0.0)
#define mod 1000000007
using namespace std;
/*
int bs(int *st,int *en,int val,char c) // en = size+1
{
    int k;
    //first element not less than val,else returns last
    if(c=='l') k=lower_bound(st,en,val)-st;
    //first element greater than val,else returns last
    if(c=='u') k=upper_bound(st,en,val)-st;
    return k;
}

int prime[78500];
int sieve() // RETURNS ACTUAL SIZE!!! NOT SIZE+1!!!! REMEMBER WELL!! >_<
{
    int a,b,c;
    c=0; prime[c]=2;
    bool *m=(bool *)calloc(1000006,sizeof(bool));
    for(a=3;a<=1000000;a=a+2)
    {
        if(!m[a])
        {
            prime[++c]=a;
            for(b=2*a;b<=1000000;b=b+a) m[b]=true;
        }
    }
    free(m);
    return c;
}

// inverse mod of i%prime = bigmod(i,prime-2)
ll bigmod(ll i,ll pow)
{
    if(pow<1) return 1;
    if(pow==1) return i%mod;
    ll j;
    if(pow%2)
    {
        j=(i*bigmod(i,pow-1))%mod;
    }
    else
    {
        j=bigmod(i,pow/2);
        j=(j*j)%mod;
    }
    return j;
}
*/
struct st
{
    ll in;
    ll val;
    bool operator < (const st &b) const
    {
        return val<b.val;
    }
};

set<ll>S,Ans;


int main()
{

    //freopen("0.in","r",stdin);
   // freopen("0.out","w",stdout);

    /*
    cout << fixed << setprecision(4);
    std::ios::sync_with_stdio(false);

    */

    ll a,b,c,d,e,x,y,z,t;

    y=1;

    //cout<<(2^4)<<endl;

    while(cin>>(z))
    {
        x=0;

        S.clear();
        Ans.clear();

        for(a=1;a<=sqrt(z)+1;a++)
        {
            if(!(z%a))
            {
                S.insert(a);
                S.insert(z/a);
            }
        }

        set<ll>::iterator it;

        for(it=S.begin();it!=S.end();it++)
        {
            if(z-(*it)>0)
            {
                c=z-(*it);
                if((z^c)==(*it)) Ans.insert(c);
            }
        }


        cout<<"Case #"<<y<<":\n";
        cout<<Ans.size()<<endl;
        for(it=Ans.begin();it!=Ans.end();it++)
        {
            if(it!=Ans.begin()) printf(" ");
            cout<<(*it);
        }
        printf("\n");
        y++;
    }


    return 0;
}