using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var mul = new HashSet<long>[40];
        for (var i = 0; i < mul.Length; ++i) mul[i] = new HashSet<long>();
        for (var i = 2L; i <= 10000; ++i)
        {
            var tmp = i;
            for (var j = 1; ; ++j)
            {
                mul[j].Add(tmp);
                tmp = tmp * i;
                if (tmp > 1_000_000_000_000) break;
            }
        }
        var q = NN;
        var ans = new int[q];
        for (var i = 0; i < q; ++i)
        {
            var ni = long.Parse(ReadLine());
            for (var j = mul.Length - 1; j > 2; --j)
            {
                if (mul[j].Contains(ni))
                {
                    ans[i] = j;
                    break;
                }
            }
            if (ans[i] == 0)
            {
                var sq = (long)Math.Sqrt(ni);
                if (sq * sq == ni) ans[i] = 2;
                else ans[i] = 1;
            }
        }
        WriteLine(string.Join("\n", ans));
    }
    static long Exp(long n, long p)
    {
        long _n = n;
        var _p = p;
        var result = 1L;
        if ((_p & 1) == 1) result *= _n;
        while (_p > 0)
        {
            _n = _n * _n;
            _p >>= 1;
            if ((_p & 1) == 1) result = result * _n;
        }
        return result;
    }
}