#include<stdio.h>
#include<string.h>
#include<math.h>
#include<algorithm>
#include<stdlib.h>
#include<vector>
using namespace std;
#define maxn 111111
#define LL long long
int main()
{
    LL n, m, i, j;
    int t;
    int ca  = 1;
    //scanf("%d",&t);
    while(scanf("%I64d",&n)!=EOF)
    {
       int aaaa;
        vector<LL> ve, res;
        LL temp = sqrt(n);
        for(i=1;i*i<=n;i++)
        {
            if(n%i==0)
            {
                ve.push_back(i);
                if(i*i!=n) ve.push_back(n/i);
            }
        }
        
        for(i=0;i<ve.size();i++)
        {
        //    printf("%I64d ",ve[i]);
            LL a  =ve[i];
        //    printf("%I64d %I64d \n",a,n);
            a = a^n;
            
            if(a%ve[i]==0&&a&&a<=n)
            res.push_back(a);
        }
        printf("Case #%d:\n",ca++);
        printf("%d\n",res.size());
        sort(res.begin(),res.end());
        if(res.size()!=0) printf("%I64d",res[0]);
        for(i=1;i<res.size();i++)
        {
            if(res[i]==res[i-1]) continue;
            printf(" %I64d",res[i]);
        }
        printf("\n");
        
    }
    return 0;
}