11970

#include <iostream>
#include <cstdio>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
#include <cstring>
#include <cmath>

#define ll long long
using namespace std;
vector<ll> v;
int main()
{
	int t;
	ll n,sq,sq_root,x;
	int kase=1;
	scanf("%d",&t);

	while(t--)
	{
		scanf("%lld",&n);
		sq=0;
		int k=0;
		v.clear();
		for(ll i=0;;i++)
		{
			sq += 2*i+1;
			sq_root=i+1;
			if(sq>=n)
			break;
			x = n-sq;
			if(x%sq_root==0 && x!=0)
			v.push_back(x);
		}
		printf("Case %d:",kase++);
		for(int i=v.size()-1;i>=0;i--)
		printf(" %lld",v[i]);
		printf("\n");
	}
	return 0;
}