#include <iostream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <time.h>
#include <random>
#include <string>
#include <cassert>
#include <vector>
#include <ostream>
#include <istream>
#include <stack>
#include <deque>
#include <queue>
#include <functional>
#include <chrono>
#include <stack>

using namespace std;

#define int long long
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define pii pair<int, int>
#define ld long double

ostream& operator<< (ostream &out, const vector<int> &b) {
    for (auto k : b) out << k << " ";
    return out;
}

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

ostream& operator<< (ostream& out, const pii& b) {
    out << "{" << b.first << ", " << b.second << "}";
    return out;
}

template <typename T1, typename T2> inline bool chkmin(T1 &x, const T2 &y) {if (x > y) {x = y; return 1;} return 0;}
template <typename T1, typename T2> inline bool chkmax(T1 &x, const T2 &y) {if (x < y) {x = y; return 1;} return 0;}


#ifdef LOCAL
    #define dbg(x) cout << #x << " : " << (x) << "\n";
    const int INF = 1e18;
    // const int mod = 2600000069;
    // const int p = 10;
#else
    #define dbg(x) 57
    const int INF = 1e18;
    // const int mod = 2600000069;
    // const int p = 179;
#endif

const ld PI = acos(-1);

#define time clock() / (double) CLOCKS_PER_SEC

// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC target("sse,sse2,sse3,sse3,sse4")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC optimize("fast-math")
// #pragma GCC target("avx2")  
// #pragma GCC optimize("section-anchors")
// #pragma GCC optimize("profile-values,profile-reorder-functions,tracer")
// #pragma GCC optimize("vpt")
// #pragma GCC optimize("rename-registers")
// #pragma GCC optimize("move-loop-invariants")
// #pragma GCC optimize("unswitch-loops")
// #pragma GCC optimize("function-sections")
// #pragma GCC optimize("data-sections")

mt19937 gen(chrono::high_resolution_clock::now().time_since_epoch().count());

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin >> n;
    vector<int> a(n);
    map<int, int> rev, cnt;
    set<pii> b;
    int ans = 0;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        int x = 1, y = 1;
        for (int j = 2; j * j * j <= a[i]; j++) {
            int c = 0;
            while (a[i] % j == 0) {
                c++;
                a[i] /= j;
            }
            c %= 3;
            if (c == 1) {
                x *= j;
            } else if (c == 2) {
                y *= j;
            }
        }
        int sq = sqrt(a[i]);
        bool ok = 0;
        for (int j = sq - 1; j <= sq + 1; j++) {
            if (j * j == a[i]) {
                y *= j;
                ok = 1;
                break;
            }
        }
        if (!ok) {
            x *= a[i];
        }
        int n1 = x * y * y, n2 = x;
        if (INF / n2 >= x) {
            n2 *= x;
            if (INF / n2 >= y) {
                n2 *= y;
                rev[n1] = n2;
                cnt[n1]++;
                b.insert({min(n1, n2), max(n1, n2)});
            } else {
                ans++;
            }
        } else {
            ans++;
        }
    }
    for (auto k : b) {
        if (k.first == 1) {
            ans++;
            continue;
        }
        ans += max(cnt[k.first], cnt[k.second]);
    }
    cout << ans << "\n";
}
/*
*/


Measured memory_bytes: 24652