Problem: You are given an array a of length n that has a special condition: every element in this array has at most 7 divisors. Find the length of the shortest non-empty subsequence of this array product of whose elements is a perfect square.

A sequence a is a subsequence of an array b if a can be obtained from b by deletion of several (possibly, zero or all) elements.

Input

The first line contains an integer n (1 ≤ n ≤ 10^5) — the length of a.

The second line contains n integers a_1, a_2, …, a_{n} (1 ≤ a_i ≤ 10^6) — the elements of the array a.

Output

Output the length of the shortest non-empty subsequence of a product of whose elements is a perfect square. If there are several shortest subsequences, you can find any of them. If there's no such subsequence, print "-1".

Examples

Input


3
1 4 6


Output


1

Input


4
2 3 6 6


Output


2

Input


3
6 15 10


Output


3

Input


4
2 3 5 7


Output


-1

Note

In the first sample, you can choose a subsequence [1].

In the second sample, you can choose a subsequence [6, 6].

In the third sample, you can choose a subsequence [6, 15, 10].

In the fourth sample, there is no such subsequence.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100000, INF = 1000000000, MOD = 1000000007;
int N, first[MAXN], at, answer = INF, dist[MAXN], good;
vector<int> vals[MAXN], adj[MAXN], start;
map<int, int> ind;
bool visited[MAXN];
queue<pair<int, pair<int, int> > > next1;
int main() {
  cin >> N;
  for (int i = 0; i < N; i++) {
    cin >> first[i];
    good = max(good, first[i]);
  }
  good = sqrt(good);
  for (int i = 0; i < N; i++) {
    int x = first[i];
    for (int j = 2; j <= sqrt(x); j++) {
      int cnt = 0;
      while (x % j == 0) {
        x /= j;
        cnt++;
      }
      if (cnt % 2 == 1) vals[i].push_back(j);
    }
    if (vals[i].empty() && x == 1) {
      cout << 1 << endl;
      return 0;
    }
    vals[i].push_back(x);
    if (vals[i].size() == 1) {
      vals[i].push_back(1);
    }
    assert(vals[i].size() == 2);
    for (int j : vals[i]) {
      if (ind.find(j) == ind.end()) {
        ind[j] = at;
        if (j <= good) start.push_back(at);
        at++;
      }
    }
    adj[ind[vals[i][0]]].push_back(ind[vals[i][1]]);
    adj[ind[vals[i][1]]].push_back(ind[vals[i][0]]);
  }
  for (int j : start) {
    memset(visited, false, sizeof(visited));
    next1.push(make_pair(0, make_pair(j, j)));
    while (!next1.empty()) {
      int d = next1.front().first;
      int x = next1.front().second.first;
      int p = next1.front().second.second;
      next1.pop();
      if (visited[x]) {
        continue;
      }
      visited[x] = true;
      dist[x] = d;
      bool skip = false;
      for (int i : adj[x]) {
        if (i != p || skip) {
          if (visited[i]) {
            answer = min(answer, dist[i] + dist[x] + 1);
          } else {
            next1.push(make_pair(d + 1, make_pair(i, x)));
          }
        } else
          skip = true;
      }
    }
  }
  if (answer == INF) answer = -1;
  cout << answer << endl;
}