#include <bits/stdc++.h>
using namespace std;
template <class T>
inline bool chmax(T& a, const T& b) {
  return b > a ? a = b, true : false;
}
template <class T>
inline bool chmin(T& a, const T& b) {
  return b < a ? a = b, true : false;
}
template <class T>
using MaxHeap = priority_queue<T>;
template <class T>
using MinHeap = priority_queue<T, vector<T>, greater<T>>;
template <class T, class F = less<T>>
void sort_uniq(vector<T>& v, F f = F()) {
  sort(begin(v), end(v), f);
  v.resize(unique(begin(v), end(v)) - begin(v));
}
template <int _MOD>
struct ModInt {
  static const auto MOD = _MOD;
  template <class T>
  using integral_only = typename enable_if<is_integral<T>::value>::type;
  int x;
  constexpr ModInt() : x() {}
  template <class T, integral_only<T>* = nullptr>
  ModInt(T _x = 0) {
    x = _x % MOD;
    if (x < 0) x += MOD;
  }
  ModInt operator-() const { return {x == 0 ? 0 : MOD - x}; }
  ModInt& operator+=(const ModInt a) {
    if ((x += a.x) >= MOD) x -= MOD;
    return *this;
  }
  ModInt& operator-=(const ModInt a) {
    if ((x += MOD - a.x) >= MOD) x -= MOD;
    return *this;
  }
  ModInt& operator*=(const ModInt a) {
    x = (long long)x * a.x % MOD;
    return *this;
  }
  ModInt& operator/=(const ModInt a) { return (*this) *= a.inv(); }
  ModInt operator+(const ModInt a) const { return ModInt(*this) += a; }
  ModInt operator-(const ModInt a) const { return ModInt(*this) -= a; }
  ModInt operator*(const ModInt a) const { return ModInt(*this) *= a; }
  ModInt operator/(const ModInt a) const { return ModInt(*this) /= a; }
  ModInt inv() const { return pow(MOD - 2); }
  ModInt inv2() const {
    int a = x, b = MOD, u = 1, v = 0;
    while (b != 0) {
      int t = a / b;
      a -= t * b;
      u -= t * v;
      swap(a, b);
      swap(u, v);
    }
    return u;
  }
  template <class T, integral_only<T>* = nullptr>
  ModInt pow(T t) const {
    ModInt r = 1, p = *this;
    while (t) {
      if (t & 1) r *= p;
      p *= p;
      t >>= 1;
    }
    return r;
  }
  bool operator==(ModInt rhs) const { return x == rhs.x; }
  bool operator!=(ModInt rhs) const { return x != rhs.x; }
  bool operator<(ModInt rhs) const { return x < rhs.x; }
  bool operator<=(ModInt rhs) const { return x <= rhs.x; }
  bool operator>(ModInt rhs) const { return x > rhs.x; }
  bool operator>=(ModInt rhs) const { return x >= rhs.x; }
  friend string to_string(ModInt i) { return to_string(i.x); }
  friend istream& operator>>(istream& i, ModInt& a) { return i >> a.x; }
  friend ostream& operator<<(ostream& o, const ModInt& a) { return o << a.x; }
};
const int MOD = 1000000007;
using mint = ModInt<MOD>;
const int primes[] = {2,  3,  5,  7,  11, 13, 17, 19, 23, 29,
                      31, 37, 41, 43, 47, 53, 59, 61, 67};
int cnt[71];
mint dp[2][1 << 19];
mint p2[100005];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n;
  cin >> n;
  p2[0] = 1;
  for (int i = 0; i < (int)(n); i++) p2[i + 1] = p2[i] * 2;
  for (int i = 0; i < (int)(n); i++) {
    int a;
    cin >> a;
    cnt[a]++;
  }
  mint *crt = dp[0], *nxt = dp[1];
  crt[0] = p2[cnt[1]];
  for (int i = 2; i <= (int)(70); i++) {
    if (!cnt[i]) continue;
    for (int j = 0; j < (int)(1 << 19); j++) nxt[j] = 0;
    int me = 0;
    int x = i;
    for (int j = 0; j < (int)(19); j++) {
      while (x % primes[j] == 0) {
        x /= primes[j];
        me ^= (1 << j);
      }
    }
    for (int j = 0; j < (int)(1 << 19); j++) {
      nxt[j ^ me] += crt[j] * p2[cnt[i] - 1];
      nxt[j] += crt[j] * p2[cnt[i] - 1];
    }
    swap(crt, nxt);
  }
  cout << crt[0] - 1 << '\n';
  return 0;
}
