2917

/*
因子个数等于质因子分解后,各项乘积

有不少需要注意的地方
*/

// include file
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cctype>
#include <ctime>

#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <bitset>

#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <list>
#include <functional>

using namespace std;

// typedef
typedef __int64 LL;

// 
#define read freopen("in.txt","r",stdin)
#define write freopen("out.txt","w",stdout)

#define Z(a,b) ((a)<<(b))
#define Y(a,b) ((a)>>(b))

const double eps = 1e-6;
const double INFf = 1e100;
const int INFi = 1000000000;
const LL INFll = (LL)1<<62;
const double Pi = acos(-1.0);

template<class T> inline T sqr(T a){return a*a;}
template<class T> inline T TMAX(T x,T y)
{
	if(x>y) return x;
	return y;
}
template<class T> inline T TMIN(T x,T y)
{
	if(x<y) return x;
	return y;
}
template<class T> inline T MMAX(T x,T y,T z)
{
	return TMAX(TMAX(x,y),z);
}
template<class T> inline T MMIN(T x,T y,T z)
{
	return TMIN(TMIN(x,y),z);
}
template<class T> inline void SWAP(T &x,T &y)
{
	T t = x;
	x = y;
	y = t;
}


// code begin
int T,N;
bool P[40000];
int stk[40000],top;

void Init()
{
	for(int i=2;i<31624;i++)
	{
		if(!P[i])
		{
			for(int j=i+i;j<31624;j+=i)
			{
				P[j] = true;
			}
		}
	}
	top = 0;
	for(int i=2;i<31624;i++)
	{
		if(!P[i])
		{
			stk[top++] = i;
		}
	}
}

int solve(int n)
{
	int mul = 1,mid;
	for(int i=0;i<top;i++)
	{
		if(n%stk[i]==0)
		{
			mid = 0;
			while(n%stk[i]==0)
			{
				n/=stk[i];
				mid++;
			}
			mul *= mid*2+1;
		}
		if(n==1) break;
	}
	if(n!=1) mul *= 3;
	return (mul+1)/2;
}

int main()
{
	read;
	write;
	Init();
	scanf("%d",&T);
	int cas=1;
	while(T--)
	{
		scanf("%d",&N);
		printf("Scenario #%d:\n",cas++);
		if(N!=1) printf("%d\n\n",solve(N));
		else printf("1\n\n");
	}
	return 0;
}