#include <bits/stdc++.h>
#include <omp.h>

using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef double ld;


#define int ll
#define rand shittttty_shit
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count());


typedef pair<int, int> pii;
typedef pair<string, string> pst;
typedef pair<pii, pii> piii;
typedef vector<piii> vpii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector< vi > vvi;
typedef vector< vvi > vvvi;
typedef vector<pii> vpi;
typedef vector<short> vs;
typedef vector<vs> vvs;
typedef vector<vvs> vvvs;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<ld> vld;
typedef vector<vld> vvld;
typedef vector<vvld> vvvld;
typedef vector<string> vst;
typedef vector<vst> vvst;
typedef pair<ld, ld> pld;
typedef pair<pld, pld> pldd;
typedef vector<pld> vpd;
typedef complex<double> base;


#define inmin(a, b) a = min(a, (b))
#define inmax(a, b) a = max(a, (b))
#define my_abs(a) (((a) >= 0) ? (a) : -(a))
#define mp(a, b) make_pair(a, (b))
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
#define sqr(x) ((x) * (x))
#define fori(i, n) for(int i = 0; i < int(n); ++i)
#define SZ(a) ((int)((a).size()))
#define MODIK(a) (a >= M ? a - M : a)
#define triple(T) tuple<T, T, T>
#define quad(T) tuple<T, T, T, T>
#define watch(x) cout << (#x) << " = " << x << endl;
#ifdef ART_HOME
#define cerr cout
#else
#define cerr if (false) cerr
#endif


const double PI = 2 * acos(0.0);

const string DIGITS = "0123456789";
const string ALPH = "abcdefghijklmnopqrstuvwxyz";

istream &operator >> (istream &in, pii &a)
{
    in >> a.first >> a.second;
    return in;
}


ostream &operator << (ostream &out, pii &a)
{
    out << a.first << ' ' << a.second;
    return out;
}


istream &operator >> (istream &in, pld &a)
{
    in >> a.first >> a.second;
    return in;
}


ostream &operator << (ostream &out, pld &a)
{
    out << a.first << ' ' << a.second;
    return out;
}


template <class T0, class T1>
inline ostream & operator << (ostream &out, pair<T0, T1> &a) {
    return out << "{" << a.first << ", " << a.second << "}";
}

template <class T0, class T1, class T2>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2> &a) {
    return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << "}";
}

template <class T0, class T1, class T2, class T3>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2, T3> &a) {
    return out << "{" << get<0>(a) << ", " << get<1>(a) <<
               ", " << get<2>(a) << ", " <<  get<3>(a) << "}";
}

template<class T>
inline ostream & operator << (ostream &out, vector<T> &a) {
    out << "[";
    fori (i, a.size())
        out << a[i] << vector<string>{", ", "]  "}[i + 1 == a.size()];
    return out;
}


void print(int a, int b, int n, vi h)
{
    ofstream cout("output.txt");
    cout << SZ(h) << ' ' << a << ' ' << b << '\n';
    for (int i = 0; i < SZ(h); ++i) {
        cout << h[i]  << ' ';
    }
    cout.close();
    exit(0);
}


inline bool break_time(ld time)
{
    return clock() > CLOCKS_PER_SEC * time;
}


void bonds()
{
    ld price, nkd, kd, year;
    int cnt;
    cout << "price nkd kd cnt year\n";
    cout << endl;
    cin >> price >> nkd >> kd >> cnt >> year;
    cout << 100 * ((1000 + kd * cnt - price * 10 - nkd) / (price * 10) / year);
}


ld get_rand_ld(ld l, ld r)
{
    uniform_real_distribution<double> gen(l, r);
    return gen(rng);
}


bool may(int E, ld T)
{
    if (E < 0)
        return 1;

    double eps = get_rand_ld(0, 1);
    return eps < exp(-E / T);
}


void smain();

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

#ifdef ART_HOME
    freopen("input.txt", "r", stdin);
    clock_t start = clock();
#endif
    cout << setprecision(2) << fixed;
    smain();
#ifdef ART_HOME
    cout << "\nTOTAL EXECUTIOn TIME: " << float( clock () - start ) /  CLOCKS_PER_SEC << endl;
#endif
}


const int N = 4000 + 10, pw = 17, K = 2e3 + 10, B = 1.1e10, oo = 2e14, M = 1 << 14, LOG = 20;
const int M1 = 1000000093, x1 = 27162;
const int M2 = 1000000087, x2 = 241;
const ld pi = atan2(1, 0) * 2, EPS = 1e-9;


bool prime(int v)
{
    for (int d = 2; d * d <= v; ++d)
    {
        if (v % d == 0)
            return 0;
    }

    return 1;
}



int get_square(int v)
{
    int c = sqrt(v);
    for (int i = max(0LL, c - 5); i <= c + 5; ++i)
        if (i * i == v)
            return i;

    return c;
}


int square(int v)
{
    int u = get_square(v);
    return u * u == v;
}



void smain()
{
    int n;
    cin >> n;

    vi kek(n);
    for (int i = 0; i < n; ++i)
        cin >> kek[i];

    vi pr;
    for (int d = 2; d * d * d <= 1e10; ++d)
    {
        if (prime(d))
            pr.push_back(d);
    }


    int ans = 0;

    map<pair<map<int, int>, int>, int> flex;


    map<int, int> hui;


    for (int v : kek)
    {
        map<int, int> cur;
        for (int d : pr)
        {
            while (v % d == 0)
            {
                cur[d]++;
                v /= d;
            }
        }

        map<int, int> cur2;
        for (auto p : cur)
        {
            p.second %= 3;
            if (p.second)
                cur2[p.first] = p.second;
        }

        if (v != 1 && square(v))
            hui[get_square(v)] = 1;

        if (v == 1 && !SZ(cur2))
            ans = 1;
        else
            flex[mp(cur2, v)]++;
    }

    map<pair<map<int, int>, int>, int> used;

    for (auto p : flex)
    {
        if (used[p.first])
            continue;

        map<int, int> cur;
        for (auto p1 : p.first.first)
            cur[p1.first] = 3 - p1.second;

        map<int, int> cur2 = p.first.first;

        int v = p.first.second;
        if (v == 1)
        {
            if (flex.count(mp(cur, 1)))
                ans += max(p.second, flex[mp(cur, 1)]),
                        used[mp(cur, 1)] = 1;
            else
                ans += p.second;
        }
        else if (square(v))
        {
            int pww = get_square(v);
            if (flex.count(mp(cur, pww)))
                ans += max(p.second, flex[mp(cur, pww)]),
                        used[mp(cur, pww)] = 1;
            else
                ans += p.second;
        }
        else if (hui.count(v))
        {
            if (flex.count(mp(cur, v * v)))
                ans += max(p.second, flex[mp(cur, v * v)]),
                        used[mp(cur, v * v)] = 1;
            else
                ans += p.second;
        }
        else
        {
            ans += p.second;
        }
    }

    cout << ans;
}


Measured memory_bytes: 53392