#ifdef stderr_path
#define LOCAL
#endif
#ifdef LOCAL
#define _GLIBCXX_DEBUG
#else
#pragma GCC optimize("Ofast")
#endif
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>

// #define NDEBUG
#define debug_stream std::cerr
#define iostream_untie true
#define __precision__ 10

#define all(v) std::begin(v), std::end(v)
#define rall(v) std::rbegin(v), std::rend(v)
#define __odd(n) ((n)&1)
#define __even(n) (not __odd(n))
#define __popcount(n) __builtin_popcountll(n)
#define __clz32(n) __builtin_clz(n)
#define __clz64(n) __builtin_clzll(n)
#define __ctz32(n) __builtin_ctz(n)
#define __ctz64(n) __builtin_ctzll(n)

using i64 = int_fast64_t;
using pii = std::pair<int, int>;
using pll = std::pair<int_fast64_t, int_fast64_t>;
template <class T>
using heap = std::priority_queue<T>;
template <class T>
using minheap = std::priority_queue<T, std::vector<T>, std::greater<T>>;
template <class T>
constexpr T inf = std::numeric_limits<T>::max() / T(2) - T(1123456);

namespace execution
{
    std::chrono::system_clock::time_point start_time, end_time;
    void print_elapsed_time()
    {
        end_time = std::chrono::system_clock::now();
        std::cerr << "\n----- Exec time : ";
        std::cerr << std::chrono::duration_cast<std::chrono::milliseconds>(
                         end_time - start_time)
                         .count();
        std::cerr << " ms -----\n\n";
    }
    struct setupper
    {
        setupper()
        {
            if(iostream_untie)
            {
                std::ios::sync_with_stdio(false);
                std::cin.tie(nullptr);
            }
            std::cout << std::fixed << std::setprecision(__precision__);
#ifdef stderr_path
            if(freopen(stderr_path, "a", stderr))
            {
                std::cerr << std::fixed << std::setprecision(__precision__);
            }
#endif
#ifdef stdout_path
            if(not freopen(stdout_path, "w", stdout))
            {
                freopen("CON", "w", stdout);
                std::cerr << "Failed to open the stdout file\n\n";
            }
            std::cout << "";
#endif
#ifdef stdin_path
            if(not freopen(stdin_path, "r", stdin))
            {
                freopen("CON", "r", stdin);
                std::cerr << "Failed to open the stdin file\n\n";
            }
#endif
#ifdef LOCAL
            std::cerr << "----- stderr at LOCAL -----\n\n";
            atexit(print_elapsed_time);
            start_time = std::chrono::system_clock::now();
#else
            fclose(stderr);
#endif
        }
    } __setupper;
} // namespace execution

class myclock_t
{
    std::chrono::system_clock::time_point built_pt, last_pt;
    int built_ln, last_ln;
    std::string built_func, last_func;
    bool is_built;

  public:
    explicit myclock_t() : is_built(false)
    {
    }
    void build(int crt_ln, const std::string &crt_func)
    {
        is_built = true;
        last_pt = built_pt = std::chrono::system_clock::now();
        last_ln = built_ln = crt_ln, last_func = built_func = crt_func;
    }
    void set(int crt_ln, const std::string &crt_func)
    {
        if(is_built)
        {
            last_pt = std::chrono::system_clock::now();
            last_ln = crt_ln, last_func = crt_func;
        }
        else
        {
            debug_stream << "[ " << crt_ln << " : " << crt_func << " ] "
                         << "myclock_t::set failed (yet to be built!)\n";
        }
    }
    void get(int crt_ln, const std::string &crt_func)
    {
        if(is_built)
        {
            std::chrono::system_clock::time_point crt_pt(
                std::chrono::system_clock::now());
            int64_t diff =
                std::chrono::duration_cast<std::chrono::milliseconds>(crt_pt -
                                                                      last_pt)
                    .count();
            debug_stream << diff << " ms elapsed from"
                         << " [ " << last_ln << " : " << last_func << " ]";
            if(last_ln == built_ln) debug_stream << " (when built)";
            debug_stream << " to"
                         << " [ " << crt_ln << " : " << crt_func << " ]"
                         << "\n";
            last_pt = built_pt, last_ln = built_ln, last_func = built_func;
        }
        else
        {
            debug_stream << "[ " << crt_ln << " : " << crt_func << " ] "
                         << "myclock_t::get failed (yet to be built!)\n";
        }
    }
};
#ifdef LOCAL
myclock_t __myclock;
#define build_clock() __myclock.build(__LINE__, __func__)
#define set_clock() __myclock.set(__LINE__, __func__)
#define get_clock() __myclock.get(__LINE__, __func__)
#else
#define build_clock() ((void)0)
#define set_clock() ((void)0)
#define get_clock() ((void)0)
#endif

namespace std
{
    template <class RAitr>
    void rsort(RAitr __first, RAitr __last)
    {
        sort(__first, __last, greater<>());
    }
    template <class T>
    size_t hash_combine(size_t seed, T const &key)
    {
        return seed ^ (hash<T>()(key) + 0x9e3779b9 + (seed << 6) + (seed >> 2));
    }
    template <class T, class U>
    struct hash<pair<T, U>>
    {
        size_t operator()(pair<T, U> const &pr) const
        {
            return hash_combine(hash_combine(0, pr.first), pr.second);
        }
    };
    template <class tuple_t, size_t index = tuple_size<tuple_t>::value - 1>
    struct tuple_hash_calc
    {
        static size_t apply(size_t seed, tuple_t const &t)
        {
            return hash_combine(
                tuple_hash_calc<tuple_t, index - 1>::apply(seed, t),
                get<index>(t));
        }
    };
    template <class tuple_t>
    struct tuple_hash_calc<tuple_t, 0>
    {
        static size_t apply(size_t seed, tuple_t const &t)
        {
            return hash_combine(seed, get<0>(t));
        }
    };
    template <class... T>
    struct hash<tuple<T...>>
    {
        size_t operator()(tuple<T...> const &t) const
        {
            return tuple_hash_calc<tuple<T...>>::apply(0, t);
        }
    };
    template <class T, class U>
    istream &operator>>(std::istream &s, pair<T, U> &p)
    {
        return s >> p.first >> p.second;
    }
    template <class T, class U>
    ostream &operator<<(std::ostream &s, const pair<T, U> p)
    {
        return s << p.first << " " << p.second;
    }
    template <class T>
    istream &operator>>(istream &s, vector<T> &v)
    {
        for(T &e : v)
        {
            s >> e;
        }
        return s;
    }
    template <class T>
    ostream &operator<<(ostream &s, const vector<T> &v)
    {
        bool is_front = true;
        for(const T &e : v)
        {
            if(not is_front)
            {
                s << ' ';
            }
            else
            {
                is_front = false;
            }
            s << e;
        }
        return s;
    }
    template <class tuple_t, size_t index>
    struct tupleos
    {
        static ostream &apply(ostream &s, const tuple_t &t)
        {
            tupleos<tuple_t, index - 1>::apply(s, t);
            return s << " " << get<index>(t);
        }
    };
    template <class tuple_t>
    struct tupleos<tuple_t, 0>
    {
        static ostream &apply(ostream &s, const tuple_t &t)
        {
            return s << get<0>(t);
        }
    };
    template <class... T>
    ostream &operator<<(ostream &s, const tuple<T...> &t)
    {
        return tupleos<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(
            s, t);
    }
    template <>
    ostream &operator<<(ostream &s, const tuple<> &t)
    {
        return s;
    }
    string revstr(string str)
    {
        reverse(str.begin(), str.end());
        return str;
    }
} // namespace std

#ifdef LOCAL
#define dump(...)                                                              \
    debug_stream << "[ " << __LINE__ << " : " << __FUNCTION__ << " ]\n",       \
        dump_func(#__VA_ARGS__, __VA_ARGS__)
template <class T>
void dump_func(const char *ptr, const T &x)
{
    debug_stream << '\t';
    for(char c = *ptr; c != '\0'; c = *++ptr)
    {
        if(c != ' ') debug_stream << c;
    }
    debug_stream << " : " << x << '\n';
}
template <class T, class... rest_t>
void dump_func(const char *ptr, const T &x, rest_t... rest)
{
    debug_stream << '\t';
    for(char c = *ptr; c != ','; c = *++ptr)
    {
        if(c != ' ') debug_stream << c;
    }
    debug_stream << " : " << x << ",\n";
    dump_func(++ptr, rest...);
}
#else
#define dump(...) ((void)0)
#endif
template <class P>
void read_range(P __first, P __second)
{
    for(P i = __first; i != __second; ++i)
        std::cin >> *i;
}
template <class P>
void write_range(P __first, P __second)
{
    for(P i = __first; i != __second;
        std::cout << (++i == __second ? '\n' : ' '))
    {
        std::cout << *i;
    }
}

// substitute y for x.
template <class T>
void subst(T &x, const T &y)
{
    x = y;
}
// substitue y for x iff x > y.
template <class T>
bool chmin(T &x, const T &y)
{
    return x > y ? x = y, true : false;
}
// substitue y for x iff x < y.
template <class T>
bool chmax(T &x, const T &y)
{
    return x < y ? x = y, true : false;
}
template <class T>
constexpr T minf(const T &x, const T &y)
{
    return std::min(x, y);
}
template <class T>
constexpr T maxf(const T &x, const T &y)
{
    return std::max(x, y);
}
// binary search.
template <class int_t, class F>
int_t bin(int_t ok, int_t ng, const F &f)
{
    while(std::abs(ok - ng) > 1)
    {
        int_t mid = (ok + ng) / 2;
        (f(mid) ? ok : ng) = mid;
    }
    return ok;
}
// be careful that val is type-sensitive.
template <class T, class A, size_t N>
void init(A (&array)[N], const T &val)
{
    std::fill((T *)array, (T *)(array + N), val);
}
void reset()
{
}
template <class A, class... rest_t>
void reset(A &array, rest_t... rest)
{
    memset(array, 0, sizeof(array));
    reset(rest...);
}
// a integer uniformly and randomly chosen from the interval [l, r).
template <typename int_t>
int_t rand_int(int_t l, int_t r)
{
    static std::random_device seed_gen;
    static std::mt19937 engine(seed_gen());
    std::uniform_int_distribution<int_t> unid(l, r - 1);
    return unid(engine);
}
// a real number uniformly and randomly chosen from the interval [l, r).
template <typename real_t>
real_t rand_real(real_t l, real_t r)
{
    static std::random_device seed_gen;
    static std::mt19937 engine(seed_gen());
    std::uniform_real_distribution<real_t> unid(l, r);
    return unid(engine);
}

/* The main code follows. */

using namespace std;
// using namespace math;

signed main()
{
    void __solve();
    void __precalc();

    unsigned int t = 1;
    // cin >> t;
    __precalc();

#ifdef LOCAL
    t = 1;
#endif

    while(t--)
    {
        __solve();
    }
}

void __precalc()
{
}

void __solve()
{
    int n, m, Q;
    cin >> n >> m;
    vector<vector<int>> g(n);
    vector<unordered_set<int>> les(n), gre(n);
    i64 ans = 0;

    for(int i = 0; i < m; ++i)
    {
        int a, b;
        cin >> a >> b;
        a--, b--;
        les[max(a, b)].emplace(min(a, b));
        gre[min(a, b)].emplace(max(a, b));
    }

    for(int v = 0; v < n; ++v)
    {
        ans += (i64)les[v].size() * gre[v].size();
    }

    std::cout << ans << "\n";

    cin >> Q;
    for(int i = 0; i < Q; ++i)
    {
        int v;
        cin >> v;
        v--;
        ans -= (i64)les[v].size() * gre[v].size();
        for(int u : gre[v])
        {
            ans += (int)les[u].size() - (int)gre[u].size() - 1;
            les[u].erase(v);
            gre[u].emplace(v);
            les[v].emplace(u);
        }
        gre[v].clear();

        std::cout << ans << "\n";
    }
}


#ifdef stderr_path
#define LOCAL
#endif
#ifdef LOCAL
#define _GLIBCXX_DEBUG
#else
#pragma GCC optimize("Ofast")
#endif
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>

// #define NDEBUG
#define debug_stream std::cerr
#define iostream_untie true
#define __precision__ 10

#define all(v) std::begin(v), std::end(v)
#define rall(v) std::rbegin(v), std::rend(v)
#define __odd(n) ((n)&1)
#define __even(n) (not __odd(n))
#define __popcount(n) __builtin_popcountll(n)
#define __clz32(n) __builtin_clz(n)
#define __clz64(n) __builtin_clzll(n)
#define __ctz32(n) __builtin_ctz(n)
#define __ctz64(n) __builtin_ctzll(n)

using i64 = int_fast64_t;
using pii = std::pair<int, int>;
using pll = std::pair<int_fast64_t, int_fast64_t>;
template <class T>
using heap = std::priority_queue<T>;
template <class T>
using minheap = std::priority_queue<T, std::vector<T>, std::greater<T>>;
template <class T>
constexpr T inf = std::numeric_limits<T>::max() / T(2) - T(1123456);

namespace execution
{
    std::chrono::system_clock::time_point start_time, end_time;
    void print_elapsed_time()
    {
        end_time = std::chrono::system_clock::now();
        std::cerr << "\n----- Exec time : ";
        std::cerr << std::chrono::duration_cast<std::chrono::milliseconds>(
                         end_time - start_time)
                         .count();
        std::cerr << " ms -----\n\n";
    }
    struct setupper
    {
        setupper()
        {
            if(iostream_untie)
            {
                std::ios::sync_with_stdio(false);
                std::cin.tie(nullptr);
            }
            std::cout << std::fixed << std::setprecision(__precision__);
#ifdef stderr_path
            if(freopen(stderr_path, "a", stderr))
            {
                std::cerr << std::fixed << std::setprecision(__precision__);
            }
#endif
#ifdef stdout_path
            if(not freopen(stdout_path, "w", stdout))
            {
                freopen("CON", "w", stdout);
                std::cerr << "Failed to open the stdout file\n\n";
            }
            std::cout << "";
#endif
#ifdef stdin_path
            if(not freopen(stdin_path, "r", stdin))
            {
                freopen("CON", "r", stdin);
                std::cerr << "Failed to open the stdin file\n\n";
            }
#endif
#ifdef LOCAL
            std::cerr << "----- stderr at LOCAL -----\n\n";
            atexit(print_elapsed_time);
            start_time = std::chrono::system_clock::now();
#else
            fclose(stderr);
#endif
        }
    } __setupper;
} // namespace execution

class myclock_t
{
    std::chrono::system_clock::time_point built_pt, last_pt;
    int built_ln, last_ln;
    std::string built_func, last_func;
    bool is_built;

  public:
    explicit myclock_t() : is_built(false)
    {
    }
    void build(int crt_ln, const std::string &crt_func)
    {
        is_built = true;
        last_pt = built_pt = std::chrono::system_clock::now();
        last_ln = built_ln = crt_ln, last_func = built_func = crt_func;
    }
    void set(int crt_ln, const std::string &crt_func)
    {
        if(is_built)
        {
            last_pt = std::chrono::system_clock::now();
            last_ln = crt_ln, last_func = crt_func;
        }
        else
        {
            debug_stream << "[ " << crt_ln << " : " << crt_func << " ] "
                         << "myclock_t::set failed (yet to be built!)\n";
        }
    }
    void get(int crt_ln, const std::string &crt_func)
    {
        if(is_built)
        {
            std::chrono::system_clock::time_point crt_pt(
                std::chrono::system_clock::now());
            int64_t diff =
                std::chrono::duration_cast<std::chrono::milliseconds>(crt_pt -
                                                                      last_pt)
                    .count();
            debug_stream << diff << " ms elapsed from"
                         << " [ " << last_ln << " : " << last_func << " ]";
            if(last_ln == built_ln) debug_stream << " (when built)";
            debug_stream << " to"
                         << " [ " << crt_ln << " : " << crt_func << " ]"
                         << "\n";
            last_pt = built_pt, last_ln = built_ln, last_func = built_func;
        }
        else
        {
            debug_stream << "[ " << crt_ln << " : " << crt_func << " ] "
                         << "myclock_t::get failed (yet to be built!)\n";
        }
    }
};
#ifdef LOCAL
myclock_t __myclock;
#define build_clock() __myclock.build(__LINE__, __func__)
#define set_clock() __myclock.set(__LINE__, __func__)
#define get_clock() __myclock.get(__LINE__, __func__)
#else
#define build_clock() ((void)0)
#define set_clock() ((void)0)
#define get_clock() ((void)0)
#endif

namespace std
{
    template <class RAitr>
    void rsort(RAitr __first, RAitr __last)
    {
        sort(__first, __last, greater<>());
    }
    template <class T>
    size_t hash_combine(size_t seed, T const &key)
    {
        return seed ^ (hash<T>()(key) + 0x9e3779b9 + (seed << 6) + (seed >> 2));
    }
    template <class T, class U>
    struct hash<pair<T, U>>
    {
        size_t operator()(pair<T, U> const &pr) const
        {
            return hash_combine(hash_combine(0, pr.first), pr.second);
        }
    };
    template <class tuple_t, size_t index = tuple_size<tuple_t>::value - 1>
    struct tuple_hash_calc
    {
        static size_t apply(size_t seed, tuple_t const &t)
        {
            return hash_combine(
                tuple_hash_calc<tuple_t, index - 1>::apply(seed, t),
                get<index>(t));
        }
    };
    template <class tuple_t>
    struct tuple_hash_calc<tuple_t, 0>
    {
        static size_t apply(size_t seed, tuple_t const &t)
        {
            return hash_combine(seed, get<0>(t));
        }
    };
    template <class... T>
    struct hash<tuple<T...>>
    {
        size_t operator()(tuple<T...> const &t) const
        {
            return tuple_hash_calc<tuple<T...>>::apply(0, t);
        }
    };
    template <class T, class U>
    istream &operator>>(std::istream &s, pair<T, U> &p)
    {
        return s >> p.first >> p.second;
    }
    template <class T, class U>
    ostream &operator<<(std::ostream &s, const pair<T, U> p)
    {
        return s << p.first << " " << p.second;
    }
    template <class T>
    istream &operator>>(istream &s, vector<T> &v)
    {
        for(T &e : v)
        {
            s >> e;
        }
        return s;
    }
    template <class T>
    ostream &operator<<(ostream &s, const vector<T> &v)
    {
        bool is_front = true;
        for(const T &e : v)
        {
            if(not is_front)
            {
                s << ' ';
            }
            else
            {
                is_front = false;
            }
            s << e;
        }
        return s;
    }
    template <class tuple_t, size_t index>
    struct tupleos
    {
        static ostream &apply(ostream &s, const tuple_t &t)
        {
            tupleos<tuple_t, index - 1>::apply(s, t);
            return s << " " << get<index>(t);
        }
    };
    template <class tuple_t>
    struct tupleos<tuple_t, 0>
    {
        static ostream &apply(ostream &s, const tuple_t &t)
        {
            return s << get<0>(t);
        }
    };
    template <class... T>
    ostream &operator<<(ostream &s, const tuple<T...> &t)
    {
        return tupleos<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(
            s, t);
    }
    template <>
    ostream &operator<<(ostream &s, const tuple<> &t)
    {
        return s;
    }
    string revstr(string str)
    {
        reverse(str.begin(), str.end());
        return str;
    }
} // namespace std

#ifdef LOCAL
#define dump(...)                                                              \
    debug_stream << "[ " << __LINE__ << " : " << __FUNCTION__ << " ]\n",       \
        dump_func(#__VA_ARGS__, __VA_ARGS__)
template <class T>
void dump_func(const char *ptr, const T &x)
{
    debug_stream << '\t';
    for(char c = *ptr; c != '\0'; c = *++ptr)
    {
        if(c != ' ') debug_stream << c;
    }
    debug_stream << " : " << x << '\n';
}
template <class T, class... rest_t>
void dump_func(const char *ptr, const T &x, rest_t... rest)
{
    debug_stream << '\t';
    for(char c = *ptr; c != ','; c = *++ptr)
    {
        if(c != ' ') debug_stream << c;
    }
    debug_stream << " : " << x << ",\n";
    dump_func(++ptr, rest...);
}
#else
#define dump(...) ((void)0)
#endif
template <class P>
void read_range(P __first, P __second)
{
    for(P i = __first; i != __second; ++i)
        std::cin >> *i;
}
template <class P>
void write_range(P __first, P __second)
{
    for(P i = __first; i != __second;
        std::cout << (++i == __second ? '\n' : ' '))
    {
        std::cout << *i;
    }
}

// substitute y for x.
template <class T>
void subst(T &x, const T &y)
{
    x = y;
}
// substitue y for x iff x > y.
template <class T>
bool chmin(T &x, const T &y)
{
    return x > y ? x = y, true : false;
}
// substitue y for x iff x < y.
template <class T>
bool chmax(T &x, const T &y)
{
    return x < y ? x = y, true : false;
}
template <class T>
constexpr T minf(const T &x, const T &y)
{
    return std::min(x, y);
}
template <class T>
constexpr T maxf(const T &x, const T &y)
{
    return std::max(x, y);
}
// binary search.
template <class int_t, class F>
int_t bin(int_t ok, int_t ng, const F &f)
{
    while(std::abs(ok - ng) > 1)
    {
        int_t mid = (ok + ng) / 2;
        (f(mid) ? ok : ng) = mid;
    }
    return ok;
}
// be careful that val is type-sensitive.
template <class T, class A, size_t N>
void init(A (&array)[N], const T &val)
{
    std::fill((T *)array, (T *)(array + N), val);
}
void reset()
{
}
template <class A, class... rest_t>
void reset(A &array, rest_t... rest)
{
    memset(array, 0, sizeof(array));
    reset(rest...);
}
// a integer uniformly and randomly chosen from the interval [l, r).
template <typename int_t>
int_t rand_int(int_t l, int_t r)
{
    static std::random_device seed_gen;
    static std::mt19937 engine(seed_gen());
    std::uniform_int_distribution<int_t> unid(l, r - 1);
    return unid(engine);
}
// a real number uniformly and randomly chosen from the interval [l, r).
template <typename real_t>
real_t rand_real(real_t l, real_t r)
{
    static std::random_device seed_gen;
    static std::mt19937 engine(seed_gen());
    std::uniform_real_distribution<real_t> unid(l, r);
    return unid(engine);
}

/* The main code follows. */

using namespace std;
// using namespace math;

signed main()
{
    void __solve();
    void __precalc();

    unsigned int t = 1;
    // cin >> t;
    __precalc();

#ifdef LOCAL
    t = 1;
#endif

    while(t--)
    {
        __solve();
    }
}

void __precalc()
{
}

void __solve()
{
    int n, m, Q;
    cin >> n >> m;
    vector<i64> deg(n);
    vector<vector<int>> gre(n);
    i64 ans = 0;

    for(int i = 0; i < m; ++i)
    {
        int a, b;
        cin >> a >> b;
        a--, b--;
        deg[a]++, deg[b]++;
        gre[min(a, b)].emplace_back(max(a, b));
    }

    for(int v = 0; v < n; ++v)
    {
        int gs = gre[v].size();
        ans += gs * (deg[v] - gs);
    }

    std::cout << ans << "\n";

    cin >> Q;
    for(int i = 0; i < Q; ++i)
    {
        int v;
        cin >> v;
        v--;
        int gs = gre[v].size();
        ans -= gs * (deg[v] - gs);
        for(int u : gre[v])
        {
            gs = gre[u].size();
            ans += deg[u] - gs * 2 - 1;
            gre[u].emplace_back(v);
        }
        gre[v].clear();

        std::cout << ans << "\n";
    }
}


/*input
5
1 2 4 5 8
*/

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define PII pair<ll, ll>
#define f first
#define s second
#define F(i,a,b) for(ll i = (ll)(a); i <= (ll)(b); i++)
#define RF(i,a,b) for(ll i = (ll)(a); i >= (ll)(b); i--)
#define MAXN 100005
#define INF LLONG_MAX
#define mod 1000000007
using namespace std;

ll n, x;
ll mp[75];
ll f0[75], f1[75];
ll pow2[MAXN];
bool mark[75];
vector < ll > primes;
ll msk[75];
int dp[75][1048576];

void pre()
{
	pow2[0] = 1;
	F(i,1,100000)
		pow2[i] = 2*pow2[i-1]%mod;
	//cout<<pow2[25]<<endl;
	F(i,1,70)
	{
		if(mp[i]>0)
			f0[i] = f1[i] = pow2[mp[i]-1];
		else
			f0[i] = 1;
	}
	F(i,2,70)
	{
		if(!mark[i])
		{
			primes.push_back(i);
			for(ll j=i;j<=70;j+=i)
				mark[j] = 1;
		}
	}
	ll sz = primes.size();
	//cout<<sz<<endl;
	F(i,2,70)
	{
		ll num = i;
		F(j,0,sz-1)
		{
			ll cnt = 0;
			while(num%primes[j] == 0)
				{
				num /= primes[j];
				cnt++;
			}
			if(cnt%2)
				msk[i] = msk[i] ^ ((ll)1<<j);
		}
	}
}

ll func(ll num, ll cur)
{
	if(num == 0)
		return cur == 0;
	//cout<<num<<" "<<cur<<endl;
	if(dp[num][cur]!=-1)
		return dp[num][cur];
	dp[num][cur] = f0[num]*func(num-1, cur)%mod;
	if(f1[num])
		dp[num][cur] = (dp[num][cur] + f1[num]*func(num-1, cur^msk[num])%mod)%mod;
	return dp[num][cur];
}

int main()
{
    ios_base::sync_with_stdio(false);cin.tie(0);
	memset(dp, -1, sizeof(dp));
	cin>>n;
	F(i,1,n)
	{
		cin>>x;
		mp[x]++;
	}
	pre();
	cout<<(func(70, 0)-1+mod)%mod<<endl;
	return 0;
}


/*input
4
1 1 1 1
*/

#include <bits/stdc++.h>
using namespace std;

#define ll int
#define PII pair<ll, ll>
#define f first
#define s second
#define F(i,a,b) for(ll i = (ll)(a); i <= (ll)(b); i++)
#define RF(i,a,b) for(ll i = (ll)(a); i >= (ll)(b); i--)
#define MAXN 100005
#define INF LLONG_MAX
#define mod 1000000007
using namespace std;

ll n, x;
ll mp[75];
ll f0[75], f1[75];
ll pow2[MAXN];
bool mark[75];
vector < ll > primes;
ll msk[75];
int dp[75][550000];

void pre()
{
	pow2[0] = 1;
	F(i,1,100000)
		pow2[i] = 2*pow2[i-1]%mod;
	//cout<<pow2[25]<<endl;
	F(i,1,70)
	{
		if(mp[i]>0)
			f0[i] = f1[i] = pow2[mp[i]-1];
		else
			f0[i] = 1;
	}
	F(i,2,70)
	{
		if(!mark[i])
		{
			primes.push_back(i);
			for(ll j=i;j<=70;j+=i)
				mark[j] = 1;
		}
	}
	ll sz = primes.size();
	//cout<<sz<<endl;
	F(i,2,70)
	{
		ll num = i;
		F(j,0,sz-1)
		{
			ll cnt = 0;
			while(num%primes[j] == 0)
			{
				num /= primes[j];
				cnt++;
			}
			if(cnt%2)
				msk[i] = msk[i] ^ ((ll)1<<j);
		}
	}
}

ll func(ll num, ll cur)
{
	if(num == 0)
		return cur == 0;
	//cout<<num<<" "<<cur<<endl;
	if(dp[num][cur]!=-1)
		return dp[num][cur];
	dp[num][cur] = f0[num]*func(num-1, cur)%mod;
	if(f1[num])
		dp[num][cur] = (dp[num][cur] + f1[num]*func(num-1, cur^msk[num])%mod)%mod;
	return dp[num][cur];
}

int main()
{
    ios_base::sync_with_stdio(false);cin.tie(0);
	memset(dp, -1, sizeof(dp));
	cin>>n;
	ll Max = 0;
	F(i,1,n)
	{
		cin>>x;
		Max = max(Max, x);
		mp[x]++;
	}
	pre();
	cout<<(func(Max, 0)-1+mod)%mod<<endl;
	return 0;
}


/*input
5
1 2 4 5 8
*/

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define PII pair<ll, ll>
#define f first
#define s second
#define F(i,a,b) for(ll i = (ll)(a); i <= (ll)(b); i++)
#define RF(i,a,b) for(ll i = (ll)(a); i >= (ll)(b); i--)
#define MAXN 100005
#define INF LLONG_MAX
#define mod 1000000007
using namespace std;

ll n, x;
ll mp[75];
ll f0[75], f1[75];
ll pow2[MAXN];
bool mark[75];
vector < ll > primes;
ll msk[75];
ll dp[75][554287];

void pre()
{
	pow2[0] = 1;
	F(i,1,100000)
		pow2[i] = 2*pow2[i-1]%mod;
	//cout<<pow2[25]<<endl;
	F(i,1,70)
	{
		if(mp[i]>0)
			f0[i] = f1[i] = pow2[mp[i]-1];
		else
			f0[i] = 1;
	}
	F(i,2,70)
	{
		if(!mark[i])
		{
			primes.push_back(i);
			for(ll j=i;j<=70;j+=i)
				mark[j] = 1;
		}
	}
	ll sz = primes.size();

	F(i,2,70)
	{
		ll num = i;
		F(j,0,sz-1)
		{
			ll cnt = 0;
			while(num%primes[j] == 0)
				{
				num /= primes[j];
				cnt++;
			}
			if(cnt%2)
				msk[i] = msk[i] ^ ((ll)1<<j);
		}
	}
}

ll func(ll num, ll cur)
{
	if(num == 0)
		return cur == 0;
	//cout<<num<<" "<<cur<<endl;
	if(dp[num][cur]!=-1)
		return dp[num][cur];
	dp[num][cur] = (f1[num]*func(num-1, cur^msk[num])%mod + f0[num]*func(num-1, cur)%mod)%mod;
	return dp[num][cur];
}

int main()
{
    ios_base::sync_with_stdio(false);cin.tie(0);
	memset(dp, -1, sizeof(dp));
	cin>>n;
	F(i,1,n)
	{
		cin>>x;
		mp[x]++;
	}
	pre();
	cout<<(func(70, 0)-1+mod)%mod<<endl;
	return 0;
}


/*input
4
1 1 1 1
*/

#include <bits/stdc++.h>
using namespace std;

#define ll int
#define PII pair<ll, ll>
#define f first
#define s second
#define F(i,a,b) for(ll i = (ll)(a); i <= (ll)(b); i++)
#define RF(i,a,b) for(ll i = (ll)(a); i >= (ll)(b); i--)
#define MAXN 100005
#define INF LLONG_MAX
#define mod 1000000007
using namespace std;

ll n, x;
ll mp[75];
ll f0[75], f1[75];
ll pow2[MAXN];
bool mark[75];
vector < ll > primes;
ll msk[75];
int dp[75][1048576];

void pre()
{
	pow2[0] = 1;
	F(i,1,100000)
		pow2[i] = 2*pow2[i-1]%mod;
	//cout<<pow2[25]<<endl;
	F(i,1,70)
	{
		if(mp[i]>0)
			f0[i] = f1[i] = pow2[mp[i]-1];
		else
			f0[i] = 1;
	}
	F(i,2,70)
	{
		if(!mark[i])
		{
			primes.push_back(i);
			for(ll j=i;j<=70;j+=i)
				mark[j] = 1;
		}
	}
	ll sz = primes.size();
	//cout<<sz<<endl;
	F(i,2,70)
	{
		ll num = i;
		F(j,0,sz-1)
		{
			ll cnt = 0;
			while(num%primes[j] == 0)
				{
				num /= primes[j];
				cnt++;
			}
			if(cnt%2)
				msk[i] = msk[i] ^ ((ll)1<<j);
		}
	}
}

ll func(ll num, ll cur)
{
	if(num == 0)
		return cur == 0;
	//cout<<num<<" "<<cur<<endl;
	if(dp[num][cur]!=-1)
		return dp[num][cur];
	dp[num][cur] = f0[num]*func(num-1, cur)%mod;
	if(f1[num])
		dp[num][cur] = (dp[num][cur] + f1[num]*func(num-1, cur^msk[num])%mod)%mod;
	return dp[num][cur];
}

int main()
{
    ios_base::sync_with_stdio(false);cin.tie(0);
	memset(dp, -1, sizeof(dp));
	cin>>n;
	F(i,1,n)
	{
		cin>>x;
		mp[x]++;
	}
	pre();
	cout<<(func(70, 0)-1+mod)%mod<<endl;
	return 0;
}


/*input
5
1 2 4 5 8
*/

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define PII pair<ll, ll>
#define f first
#define s second
#define F(i,a,b) for(ll i = (ll)(a); i <= (ll)(b); i++)
#define RF(i,a,b) for(ll i = (ll)(a); i >= (ll)(b); i--)
#define MAXN 100005
#define INF LLONG_MAX
#define mod 1000000007
using namespace std;

ll n, x;
ll mp[75];
ll f0[75], f1[75];
ll pow2[MAXN];
bool mark[75];
vector < ll > primes;
ll msk[75];
int dp[75][1048576];

void pre()
{
	pow2[0] = 1;
	F(i,1,100000)
		pow2[i] = 2*pow2[i-1]%mod;
	//cout<<pow2[25]<<endl;
	F(i,1,70)
	{
		if(mp[i]>0)
			f0[i] = f1[i] = pow2[mp[i]-1];
		else
			f0[i] = 1;
	}
	F(i,2,70)
	{
		if(!mark[i])
		{
			primes.push_back(i);
			for(ll j=i;j<=70;j+=i)
				mark[j] = 1;
		}
	}
	ll sz = primes.size();
	//cout<<sz<<endl;
	F(i,2,70)
	{
		ll num = i;
		F(j,0,sz-1)
		{
			ll cnt = 0;
			while(num%primes[j] == 0)
				{
				num /= primes[j];
				cnt++;
			}
			if(cnt%2)
				msk[i] = msk[i] ^ ((ll)1<<j);
		}
	}
}

ll func(ll num, ll cur)
{
	if(num == 0)
		return cur == 0;
	//cout<<num<<" "<<cur<<endl;
	if(dp[num][cur]!=-1)
		return dp[num][cur];
	dp[num][cur] = (f1[num]*func(num-1, cur^msk[num])%mod + f0[num]*func(num-1, cur)%mod)%mod;
	return dp[num][cur];
}

int main()
{
    ios_base::sync_with_stdio(false);cin.tie(0);
	memset(dp, -1, sizeof(dp));
	cin>>n;
	F(i,1,n)
	{
		cin>>x;
		mp[x]++;
	}
	pre();
	cout<<(func(70, 0)-1+mod)%mod<<endl;
	return 0;
}


/*input
4
1 1 1 1
*/

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define PII pair<ll, ll>
#define f first
#define s second
#define F(i,a,b) for(ll i = (ll)(a); i <= (ll)(b); i++)
#define RF(i,a,b) for(ll i = (ll)(a); i >= (ll)(b); i--)
#define MAXN 100005
#define INF LLONG_MAX
#define mod 1000000007
using namespace std;

ll n, x;
ll mp[75];
ll f0[75], f1[75];
ll pow2[MAXN];
bool mark[75];
vector < ll > primes;
ll msk[75];
int dp[75][550000];

void pre()
{
	pow2[0] = 1;
	F(i,1,100000)
		pow2[i] = 2*pow2[i-1]%mod;
	//cout<<pow2[25]<<endl;
	F(i,1,70)
	{
		if(mp[i]>0)
			f0[i] = f1[i] = pow2[mp[i]-1];
		else
			f0[i] = 1;
	}
	F(i,2,70)
	{
		if(!mark[i])
		{
			primes.push_back(i);
			for(ll j=i;j<=70;j+=i)
				mark[j] = 1;
		}
	}
	ll sz = primes.size();
	//cout<<sz<<endl;
	F(i,2,70)
	{
		ll num = i;
		F(j,0,sz-1)
		{
			ll cnt = 0;
			while(num%primes[j] == 0)
			{
				num /= primes[j];
				cnt++;
			}
			if(cnt%2)
				msk[i] = msk[i] ^ ((ll)1<<j);
		}
	}
}

ll func(ll num, ll cur)
{
	if(num == 0)
		return cur == 0;
	//cout<<num<<" "<<cur<<endl;
	if(dp[num][cur]!=-1)
		return dp[num][cur];
	dp[num][cur] = f0[num]*func(num-1, cur)%mod;
	if(f1[num])
		dp[num][cur] = (dp[num][cur] + f1[num]*func(num-1, cur^msk[num])%mod)%mod;
	return dp[num][cur];
}

int main()
{
    ios_base::sync_with_stdio(false);cin.tie(0);
	memset(dp, -1, sizeof(dp));
	cin>>n;
	ll Max = 0;
	F(i,1,n)
	{
		cin>>x;
		Max = max(Max, x);
		mp[x]++;
	}
	pre();
	cout<<(func(Max, 0)-1+mod)%mod<<endl;
	return 0;
}


/*input
5
1 2 4 5 8
*/

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define PII pair<ll, ll>
#define f first
#define s second
#define F(i,a,b) for(ll i = (ll)(a); i <= (ll)(b); i++)
#define RF(i,a,b) for(ll i = (ll)(a); i >= (ll)(b); i--)
#define MAXN 100005
#define INF LLONG_MAX
#define mod 1000000007
using namespace std;

ll n, x;
ll mp[75];
ll f0[75], f1[75];
ll pow2[MAXN];
bool mark[75];
vector < ll > primes;
ll msk[75];
ll dp[75][1048576];

void pre()
{
	pow2[0] = 1;
	F(i,1,100000)
		pow2[i] = 2*pow2[i-1]%mod;
	//cout<<pow2[25]<<endl;
	F(i,1,70)
	{
		if(mp[i]>0)
			f0[i] = f1[i] = pow2[mp[i]-1];
		else
			f0[i] = 1;
	}
	F(i,2,70)
	{
		if(!mark[i])
		{
			primes.push_back(i);
			for(ll j=i;j<=70;j+=i)
				mark[j] = 1;
		}
	}
	ll sz = primes.size();

	F(i,2,70)
	{
		ll num = i;
		F(j,0,sz-1)
		{
			ll cnt = 0;
			while(num%primes[j] == 0)
				{
				num /= primes[j];
				cnt++;
			}
			if(cnt%2)
				msk[i] = msk[i] ^ ((ll)1<<j);
		}
	}
}

ll func(ll num, ll cur)
{
	if(num == 0)
		return cur == 0;
	//cout<<num<<" "<<cur<<endl;
	if(dp[num][cur]!=-1)
		return dp[num][cur];
	dp[num][cur] = f1[num]*func(num-1, cur^msk[num]) + f0[num]*func(num-1, cur);
	return dp[num][cur];
}

int main()
{
    ios_base::sync_with_stdio(false);cin.tie(0);
	memset(dp, -1, sizeof(dp));
	cin>>n;
	F(i,1,n)
	{
		cin>>x;
		mp[x]++;
	}
	pre();
	cout<<func(70, 0)-1<<endl;
	return 0;
}


#define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl '\n'
#define INF (1LL<<25)
#define ff first
#define ss second
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define int long long
#define all(a) a.begin(), a.end()
#define inf (1LL<<61)
#define ull unsigned long long
#define debug1(x) cerr << #x << ": " << x <<'\n'
#define debug2(x, y) cerr << #x << ": " << x << '\t' << #y << ": " << y <<'\n'
#define debug3(x, y, z) cerr << #x << ": " << x << '\t' << #y << ": " << y << '\t' << #z << ": " << z <<'\n'
using namespace std;
int dx[]={1,0,-1,0};int dy[]={0,1,0,-1}; //4 Direction
//int dx[]={1,1,0,-1,-1,-1,0,1};int dy[]={0,1,1,1,0,-1,-1,-1};//8 direction
int gcd(int x,int y)
{
    if(y==0)
        return x;
    else
        return gcd(y,x%y);
}
int expo(int n,int m,int p)   //modULAR EXPONENTIATION
{
    int r=1;
    n=n%p;
    while(m>0)
    {
        if(m%2)
            r=(r*n)%p;
        n=(n*n)%p;
        m=m/2;
    }
    return r%p;
}
bool isPrime(int n)
{
    // Corner cases
    if (n <= 1)  return false;
    if (n <= 3)  return true;

    // This is checked so that we can skip
    // middle five numbers in below loop
    if (n%2 == 0 || n%3 == 0) return false;

    for (int i=5; i*i<=n; i=i+6)
        if (n%i == 0 || n%(i+2) == 0)
           return false;

    return true;
}
int n;
vector<int>a(71);
vector<int>f[76];
vector<int>fac(100005);
vector<int>isP(71);
map<pair<int,int>,int>d;
int solve(int x,int y)
{
      if(x==71)
      {
            if(y==0||y==1)
            {
                  int y=expo(2,a[1],mod);
                  return y;
            }
            return 0;
      }
      if(a[x]==0)
      {
            return solve(x+1,y);
      }
      if(d.find(mp(x,y))!=d.end())
      {
            return d[make_pair(x,y)];
      }
      int l=1,ans=0,ty=y;
      for(int i=0;i<f[x].size();i++)
      {
            if(ty&(1LL<<isP[f[x][i]]))
            {
                  ty&=~(1LL << isP[f[x][i]]);
            }
            else
            {
                  ty=ty|(1LL<<isP[f[x][i]]);
            }
      }
      for(int i=0;i<=a[x];i++)
      {
            int g=(((fac[a[x]]*(expo(fac[i],mod-2,mod)))%mod)*(expo(fac[a[x]-i],mod-2,mod)))%mod;
            if(i==0)
            {
                  ans=(ans+solve(x+1,y))%mod;
            }
            else if(y==0)
            {
                  if(i%2==0)
                  {
                        ans=(ans+(g*solve(x+1,y))%mod)%mod;
                  }
                  else
                  {
                        ans=(ans+(g*solve(x+1,ty))%mod)%mod;
                  }
            }
            else
            {
                  if(i%2==0)
                  {
                        ans=(ans+(g*solve(x+1,y))%mod)%mod;
                  }
                  else
                  {
                        ans=(ans+(g*solve(x+1,ty))%mod)%mod;
                  }
            }
      }
      d[make_pair(x,y)]=ans;
      return ans;
}
int32_t main()
{
   IOS;
   #ifndef ONLINE_JUDGE
   freopen("input.txt","r",stdin);
   freopen("output.txt","w",stdout);
   #endif
   /********************* Code starts here ***********************/
   cin>>n;

   int p=1;
   for(int i=2;i<=70;i++)
   {
      if(isPrime(i))
      {
            isP[i]=p++;
      }
   }
   for(int i=2;i<=70;i++)
   {
      int k=i;
      for(int j=2;j*j<=i;j++)
      {
            int c=0;
            while(k%j==0)
            {
                  c++;
                  k=k/j;
            }
            if(c%2==1)
            {
                  f[i].pb(j);
            }
            if(i%j==0)
            {
                  int u=i/j;
                  if(isPrime(u))
                  {
                        c=0;
                        k=i;
                        while(k%u==0)
                        {
                              c++;
                              k=k/u;
                        }
                        if(c%2==1)
                        {
                              f[i].pb(u);
                        }
                  }
            }
      }
   }
   for(int i=2;i<=70;i++)
   {
      if(f[i].size()==0)
            f[i].pb(i);
   }
   fac[0]=1;
   p=1;
   for(int i=1;i<=100000;i++)
   {
      p=(p*i)%mod;
      fac[i]=p;
   }
   for(int i=0;i<n;i++)
   {
      int x;
      cin>>x;
      a[x]++;
   }
   int ans=(solve(2,1)-1+mod)%mod;
   cout<<ans<<endl;
}


#define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl '\n'
#define INF (1LL<<25)
#define ff first
#define ss second
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define int long long
#define all(a) a.begin(), a.end()
#define inf (1LL<<61)
#define ull unsigned long long
#define debug1(x) cerr << #x << ": " << x <<'\n'
#define debug2(x, y) cerr << #x << ": " << x << '\t' << #y << ": " << y <<'\n'
#define debug3(x, y, z) cerr << #x << ": " << x << '\t' << #y << ": " << y << '\t' << #z << ": " << z <<'\n'
using namespace std;
int dx[]={1,0,-1,0};int dy[]={0,1,0,-1}; //4 Direction
//int dx[]={1,1,0,-1,-1,-1,0,1};int dy[]={0,1,1,1,0,-1,-1,-1};//8 direction
int gcd(int x,int y)
{
    if(y==0)
        return x;
    else
        return gcd(y,x%y);
}
int expo(int n,int m,int p)   //modULAR EXPONENTIATION
{
    int r=1;
    n=n%p;
    while(m>0)
    {
        if(m%2)
            r=(r*n)%p;
        n=(n*n)%p;
        m=m/2;
    }
    return r%p;
}
bool isPrime(int n)
{
    // Corner cases
    if (n <= 1)  return false;
    if (n <= 3)  return true;

    // This is checked so that we can skip
    // middle five numbers in below loop
    if (n%2 == 0 || n%3 == 0) return false;

    for (int i=5; i*i<=n; i=i+6)
        if (n%i == 0 || n%(i+2) == 0)
           return false;

    return true;
}
int n;
vector<int>a(71);
vector<int>f[76];
vector<int>fac(100005);
vector<int>isP(71);
map<pair<int,int>,int>d;
int solve(int x,int y)
{
      if(x==71)
      {
            if(y==0||y==1)
            {
                  int y=expo(2,a[1],mod);
                  return y;
            }
            return 0;
      }
      if(a[x]==0)
      {
            return solve(x+1,y);
      }
      /*if(d.find(mp(x,y))!=d.end())
      {
            return d[make_pair(x,y)];
      }*/
      int l=1,ans=0,ty=y;
      for(int i=0;i<f[x].size();i++)
      {
            if(ty&(1LL<<isP[f[x][i]]))
            {
                  ty&=~(1LL << isP[f[x][i]]);
            }
            else
            {
                  ty=ty|(1LL<<isP[f[x][i]]);
            }
      }
      ans=(ans+(expo(2,a[x]-1,mod)*(solve(x+1,y)+solve(x+1,ty)))%mod)%mod;
      return ans;
      /*for(int i=0;i<=a[x];i++)
      {
            int g=(((fac[a[x]]*(expo(fac[i],mod-2,mod)))%mod)*(expo(fac[a[x]-i],mod-2,mod)))%mod;
            if(i==0)
            {
                  ans=(ans+solve(x+1,y))%mod;
            }
            else if(y==0)
            {
                  if(i%2==0)
                  {
                        ans=(ans+(g*solve(x+1,y))%mod)%mod;
                  }
                  else
                  {
                        ans=(ans+(g*solve(x+1,ty))%mod)%mod;
                  }
            }
            else
            {
                  if(i%2==0)
                  {
                        ans=(ans+(g*solve(x+1,y))%mod)%mod;
                  }
                  else
                  {
                        ans=(ans+(g*solve(x+1,ty))%mod)%mod;
                  }
            }
      }
      d[make_pair(x,y)]=ans;
      return ans;*/
}
int32_t main()
{
   IOS;
   #ifndef ONLINE_JUDGE
   freopen("input.txt","r",stdin);
   freopen("output.txt","w",stdout);
   #endif
   /********************* Code starts here ***********************/
   cin>>n;

   int p=1;
   for(int i=2;i<=70;i++)
   {
      if(isPrime(i))
      {
            isP[i]=p++;
      }
   }
   for(int i=2;i<=70;i++)
   {
      int k=i;
      for(int j=2;j*j<=i;j++)
      {
            int c=0;
            while(k%j==0)
            {
                  c++;
                  k=k/j;
            }
            if(c%2==1)
            {
                  f[i].pb(j);
            }
            if(i%j==0)
            {
                  int u=i/j;
                  if(isPrime(u))
                  {
                        c=0;
                        k=i;
                        while(k%u==0)
                        {
                              c++;
                              k=k/u;
                        }
                        if(c%2==1)
                        {
                              f[i].pb(u);
                        }
                  }
            }
      }
   }
   for(int i=2;i<=70;i++)
   {
      if(f[i].size()==0)
            f[i].pb(i);
   }
   fac[0]=1;
   p=1;
   for(int i=1;i<=100000;i++)
   {
      p=(p*i)%mod;
      fac[i]=p;
   }
   for(int i=0;i<n;i++)
   {
      int x;
      cin>>x;
      a[x]++;
   }
   int ans=(solve(2,1)-1+mod)%mod;
   cout<<ans<<endl;
}


#define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl '\n'
#define INF (1LL<<25)
#define ff first
#define ss second
#define mod 1000000007
#define pb push_back
#define mp make_pair
//#define int long long
#define all(a) a.begin(), a.end()
#define inf (1LL<<61)
#define ull unsigned long long
#define debug1(x) cerr << #x << ": " << x <<'\n'
#define debug2(x, y) cerr << #x << ": " << x << '\t' << #y << ": " << y <<'\n'
#define debug3(x, y, z) cerr << #x << ": " << x << '\t' << #y << ": " << y << '\t' << #z << ": " << z <<'\n'
using namespace std;
int dx[]={1,0,-1,0};int dy[]={0,1,0,-1}; //4 Direction
//int dx[]={1,1,0,-1,-1,-1,0,1};int dy[]={0,1,1,1,0,-1,-1,-1};//8 direction
int gcd(int x,int y)
{
    if(y==0)
        return x;
    else
        return gcd(y,x%y);
}
int expo(int n,int m,int p)   //modULAR EXPONENTIATION
{
    int r=1;
    n=n%p;
    while(m>0)
    {
        if(m%2)
            r=(r*n)%p;
        n=(n*n)%p;
        m=m/2;
    }
    return r%p;
}
bool isPrime(int n)
{
    // Corner cases
    if (n <= 1)  return false;
    if (n <= 3)  return true;

    // This is checked so that we can skip
    // middle five numbers in below loop
    if (n%2 == 0 || n%3 == 0) return false;

    for (int i=5; i*i<=n; i=i+6)
        if (n%i == 0 || n%(i+2) == 0)
           return false;

    return true;
}
int n;
vector<int>a(71);
vector<int>f[76];
vector<int>isP(71);
int dp[71][(1<<19)+1];
int solve(int x,int y)
{
      if(x==71)
      {
            if(y==0)
            {
                  int y=expo(2,a[1],mod);
                  return y;
            }
            return 0;
      }
      if(a[x]==0)
      {
            return solve(x+1,y);
      }
      if(dp[x][y]!=-1)
            return dp[x][y];
      int l=1,ans=0,ty=y;
      for(int i=0;i<f[x].size();i++)
      {
            if(ty&(1LL<<isP[f[x][i]]))
            {
                  ty&=~(1LL << isP[f[x][i]]);
            }
            else
            {
                  ty=ty|(1LL<<isP[f[x][i]]);
            }
      }
      ans=(ans+(expo(2,a[x]-1,mod)*(solve(x+1,y)+solve(x+1,ty)))%mod)%mod;
      dp[x][y]=ans;
      return ans;
      /*for(int i=0;i<=a[x];i++)
      {
            int g=(((fac[a[x]]*(expo(fac[i],mod-2,mod)))%mod)*(expo(fac[a[x]-i],mod-2,mod)))%mod;
            if(i==0)
            {
                  ans=(ans+solve(x+1,y))%mod;
            }
            else if(y==0)
            {
                  if(i%2==0)
                  {
                        ans=(ans+(g*solve(x+1,y))%mod)%mod;
                  }
                  else
                  {
                        ans=(ans+(g*solve(x+1,ty))%mod)%mod;
                  }
            }
            else
            {
                  if(i%2==0)
                  {
                        ans=(ans+(g*solve(x+1,y))%mod)%mod;
                  }
                  else
                  {
                        ans=(ans+(g*solve(x+1,ty))%mod)%mod;
                  }
            }
      }
      d[make_pair(x,y)]=ans;
      return ans;*/
}
int32_t main()
{
   IOS;
   #ifndef ONLINE_JUDGE
   freopen("input.txt","r",stdin);
   freopen("output.txt","w",stdout);
   #endif
   /********************* Code starts here ***********************/
   cin>>n;
   for(int i=0;i<71;i++)
   {
      for(int j=0;j<=(1LL<<19);j++)
      {
            dp[i][j]=-1;
      }
   }
   int p=0;
   for(int i=2;i<=70;i++)
   {
      if(isPrime(i))
      {
            isP[i]=p++;
      }
   }
   //cout<<p<<endl;
   for(int i=2;i<=70;i++)
   {
      int k=i;
      for(int j=2;j*j<=i;j++)
      {
            int c=0;
            while(k%j==0)
            {
                  c++;
                  k=k/j;
            }
            if(c%2==1)
            {
                  f[i].pb(j);
            }
            if(i%j==0)
            {
                  int u=i/j;
                  if(isPrime(u))
                  {
                        c=0;
                        k=i;
                        while(k%u==0)
                        {
                              c++;
                              k=k/u;
                        }
                        if(c%2==1)
                        {
                              f[i].pb(u);
                        }
                  }
            }
      }
   }
   for(int i=2;i<=70;i++)
   {
      if(f[i].size()==0)
            f[i].pb(i);
   }
   p=1;

   for(int i=0;i<n;i++)
   {
      int x;
      cin>>x;
      a[x]++;
   }
   int ans=(solve(2,0)-1+mod)%mod;
   cout<<ans<<endl;
}


#define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl '\n'
#define INF (1LL<<25)
#define ff first
#define ss second
#define mod 1000000007
#define pb push_back
#define mp make_pair
//#define int long long
#define all(a) a.begin(), a.end()
#define inf (1LL<<61)
#define ull unsigned long long
#define debug1(x) cerr << #x << ": " << x <<'\n'
#define debug2(x, y) cerr << #x << ": " << x << '\t' << #y << ": " << y <<'\n'
#define debug3(x, y, z) cerr << #x << ": " << x << '\t' << #y << ": " << y << '\t' << #z << ": " << z <<'\n'
using namespace std;
int dx[]={1,0,-1,0};int dy[]={0,1,0,-1}; //4 Direction
//int dx[]={1,1,0,-1,-1,-1,0,1};int dy[]={0,1,1,1,0,-1,-1,-1};//8 direction
int gcd(int x,int y)
{
    if(y==0)
        return x;
    else
        return gcd(y,x%y);
}
int expo(int n,int m,int p)   //modULAR EXPONENTIATION
{
    int r=1;
    n=n%p;
    while(m>0)
    {
        if(m%2)
            r=(r*n)%p;
        n=(n*n)%p;
        m=m/2;
    }
    return r%p;
}
bool isPrime(int n)
{
    // Corner cases
    if (n <= 1)  return false;
    if (n <= 3)  return true;

    // This is checked so that we can skip
    // middle five numbers in below loop
    if (n%2 == 0 || n%3 == 0) return false;

    for (int i=5; i*i<=n; i=i+6)
        if (n%i == 0 || n%(i+2) == 0)
           return false;

    return true;
}
int n;
vector<int>a(71);
vector<int>f[76];
vector<int>isP(71);
int dp[71][(1<<19)+1];
int solve(int x,int y)
{
      if(x==71)
      {
            if(y==0)
            {
                  int y=expo(2,a[1],mod);
                  return y;
            }
            return 0;
      }
      if(a[x]==0)
      {
            return solve(x+1,y);
      }
      if(dp[x][y]!=-1)
            return dp[x][y];
      int l=1,ans=0,ty=y;
      for(int i=0;i<f[x].size();i++)
      {
            if(ty&(1LL<<isP[f[x][i]]))
            {
                  ty&=~(1LL << isP[f[x][i]]);
            }
            else
            {
                  ty=ty|(1LL<<isP[f[x][i]]);
            }
      }
      //    debug2(y,f[x][0]);
      ans=(ans+(expo(2,a[x]-1,mod)*(solve(x+1,y)+solve(x+1,ty)))%mod)%mod;
      dp[x][y]=ans;
      return ans;
      /*for(int i=0;i<=a[x];i++)
      {
            int g=(((fac[a[x]]*(expo(fac[i],mod-2,mod)))%mod)*(expo(fac[a[x]-i],mod-2,mod)))%mod;
            if(i==0)
            {
                  ans=(ans+solve(x+1,y))%mod;
            }
            else if(y==0)
            {
                  if(i%2==0)
                  {
                        ans=(ans+(g*solve(x+1,y))%mod)%mod;
                  }
                  else
                  {
                        ans=(ans+(g*solve(x+1,ty))%mod)%mod;
                  }
            }
            else
            {
                  if(i%2==0)
                  {
                        ans=(ans+(g*solve(x+1,y))%mod)%mod;
                  }
                  else
                  {
                        ans=(ans+(g*solve(x+1,ty))%mod)%mod;
                  }
            }
      }
      d[make_pair(x,y)]=ans;
      return ans;*/
}
int32_t main()
{
   IOS;
   #ifndef ONLINE_JUDGE
   freopen("input.txt","r",stdin);
   freopen("output.txt","w",stdout);
   #endif
   /********************* Code starts here ***********************/
   cin>>n;
   for(int i=0;i<71;i++)
   {
      for(int j=0;j<=(1LL<<19);j++)
      {
            dp[i][j]=-1;
      }
   }
   int p=0;
   for(int i=2;i<=70;i++)
   {
      if(isPrime(i))
      {
            isP[i]=p++;
      }
   }
   //cout<<p<<endl;
   for(int i=2;i<=70;i++)
   {
      int k=i;
      for(int j=2;j*j<=i;j++)
      {
            int c=0;
            while(k%j==0)
            {
                  c++;
                  k=k/j;
            }
            if(c%2==1)
            {
                  f[i].pb(j);
            }
            if(i%j==0)
            {
                  int u=i/j;
                  if(isPrime(u))
                  {
                        c=0;
                        k=i;
                        while(k%u==0)
                        {
                              c++;
                              k=k/u;
                        }
                        if(c%2==1)
                        {
                              f[i].pb(u);
                        }
                  }
            }
      }
   }
   for(int i=2;i<=70;i++)
   {
      if(f[i].size()==0 && isPrime(i))
            f[i].pb(i);
   }
   p=1;

   for(int i=0;i<n;i++)
   {
      int x;
      cin>>x;
      a[x]++;
   }
   int ans=(solve(2,0)-1+mod)%mod;
   cout<<ans<<endl;
}


#define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl '\n'
#define INF (1LL<<25)
#define ff first
#define ss second
#define mod 1000000007
#define pb push_back
#define mp make_pair
//#define int long long
#define all(a) a.begin(), a.end()
#define inf (1LL<<61)
#define ull unsigned long long
#define debug1(x) cerr << #x << ": " << x <<'\n'
#define debug2(x, y) cerr << #x << ": " << x << '\t' << #y << ": " << y <<'\n'
#define debug3(x, y, z) cerr << #x << ": " << x << '\t' << #y << ": " << y << '\t' << #z << ": " << z <<'\n'
using namespace std;
int dx[]={1,0,-1,0};int dy[]={0,1,0,-1}; //4 Direction
//int dx[]={1,1,0,-1,-1,-1,0,1};int dy[]={0,1,1,1,0,-1,-1,-1};//8 direction
int gcd(int x,int y)
{
    if(y==0)
        return x;
    else
        return gcd(y,x%y);
}
int expo(int n,int m,int p)   //modULAR EXPONENTIATION
{
    int r=1;
    n=n%p;
    while(m>0)
    {
        if(m%2)
            r=(r*n)%p;
        n=(n*n)%p;
        m=m/2;
    }
    return r%p;
}
bool isPrime(int n)
{
    // Corner cases
    if (n <= 1)  return false;
    if (n <= 3)  return true;

    // This is checked so that we can skip
    // middle five numbers in below loop
    if (n%2 == 0 || n%3 == 0) return false;

    for (int i=5; i*i<=n; i=i+6)
        if (n%i == 0 || n%(i+2) == 0)
           return false;

    return true;
}
int n;
vector<int>a(71);
vector<int>f[76];
vector<int>isP(71);
int dp[71][(1<<19)+1];
int solve(int x,int y)
{
      if(x==71)
      {
            if(y==0)
            {
                  int y=expo(2,a[1],mod);
                  return y;
            }
            return 0;
      }
      if(a[x]==0)
      {
            return solve(x+1,y);
      }
      if(dp[x][y]!=-1)
            return dp[x][y];
      int l=1,ans=0,ty=y;
      for(int i=0;i<f[x].size();i++)
      {
            if(ty&(1LL<<isP[f[x][i]]))
            {
                  ty&=~(1LL << isP[f[x][i]]);
            }
            else
            {
                  ty=ty|(1LL<<isP[f[x][i]]);
            }
      }
      //    debug2(y,f[x][0]);
      ans=(ans+(expo(2,a[x]-1,mod)*((solve(x+1,y)+solve(x+1,ty))%mod))%mod)%mod;
      dp[x][y]=ans;
      return ans;
      /*for(int i=0;i<=a[x];i++)
      {
            int g=(((fac[a[x]]*(expo(fac[i],mod-2,mod)))%mod)*(expo(fac[a[x]-i],mod-2,mod)))%mod;
            if(i==0)
            {
                  ans=(ans+solve(x+1,y))%mod;
            }
            else if(y==0)
            {
                  if(i%2==0)
                  {
                        ans=(ans+(g*solve(x+1,y))%mod)%mod;
                  }
                  else
                  {
                        ans=(ans+(g*solve(x+1,ty))%mod)%mod;
                  }
            }
            else
            {
                  if(i%2==0)
                  {
                        ans=(ans+(g*solve(x+1,y))%mod)%mod;
                  }
                  else
                  {
                        ans=(ans+(g*solve(x+1,ty))%mod)%mod;
                  }
            }
      }
      d[make_pair(x,y)]=ans;
      return ans;*/
}
int32_t main()
{
   IOS;
   #ifndef ONLINE_JUDGE
   freopen("input.txt","r",stdin);
   freopen("output.txt","w",stdout);
   #endif
   /********************* Code starts here ***********************/
   cin>>n;
   for(int i=0;i<71;i++)
   {
      for(int j=0;j<=(1LL<<19);j++)
      {
            dp[i][j]=-1;
      }
   }
   int p=0;
   for(int i=2;i<=70;i++)
   {
      if(isPrime(i))
      {
            isP[i]=p++;
      }
   }
   //cout<<p<<endl;
   for(int i=2;i<=70;i++)
   {
      int k=i;
      for(int j=2;j*j<=i;j++)
      {
            int c=0;
            while(k%j==0)
            {
                  c++;
                  k=k/j;
            }
            if(c%2==1)
            {
                  f[i].pb(j);
            }
            if(i%j==0)
            {
                  int u=i/j;
                  if(isPrime(u))
                  {
                        c=0;
                        k=i;
                        while(k%u==0)
                        {
                              c++;
                              k=k/u;
                        }
                        if(c%2==1)
                        {
                              f[i].pb(u);
                        }
                  }
            }
      }
   }
   for(int i=2;i<=70;i++)
   {
      if(f[i].size()==0 && isPrime(i))
            f[i].pb(i);
   }
   p=1;

   for(int i=0;i<n;i++)
   {
      int x;
      cin>>x;
      a[x]++;
   }
   int ans=(solve(2,0)-1+mod)%mod;
   cout<<ans<<endl;
}


#define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl '\n'
#define INF (1LL<<25)
#define ff first
#define ss second
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define int long long
#define all(a) a.begin(), a.end()
#define inf (1LL<<61)
#define ull unsigned long long
#define debug1(x) cerr << #x << ": " << x <<'\n'
#define debug2(x, y) cerr << #x << ": " << x << '\t' << #y << ": " << y <<'\n'
#define debug3(x, y, z) cerr << #x << ": " << x << '\t' << #y << ": " << y << '\t' << #z << ": " << z <<'\n'
using namespace std;
int dx[]={1,0,-1,0};int dy[]={0,1,0,-1}; //4 Direction
//int dx[]={1,1,0,-1,-1,-1,0,1};int dy[]={0,1,1,1,0,-1,-1,-1};//8 direction
int gcd(int x,int y)
{
    if(y==0)
        return x;
    else
        return gcd(y,x%y);
}
int expo(int n,int m,int p)   //modULAR EXPONENTIATION
{
    int r=1;
    n=n%p;
    while(m>0)
    {
        if(m%2)
            r=(r*n)%p;
        n=(n*n)%p;
        m=m/2;
    }
    return r%p;
}
bool isPrime(int n)
{
    // Corner cases
    if (n <= 1)  return false;
    if (n <= 3)  return true;

    // This is checked so that we can skip
    // middle five numbers in below loop
    if (n%2 == 0 || n%3 == 0) return false;

    for (int i=5; i*i<=n; i=i+6)
        if (n%i == 0 || n%(i+2) == 0)
           return false;

    return true;
}
int n;
vector<int>a(71);
vector<int>f[76];
vector<int>isP(71);
int dp[71][(1<<19)+1];
int solve(int x,int y)
{
      if(x==71)
      {
            if(y==0)
            {
                  int y=expo(2,a[1],mod);
                  return y;
            }
            return 0;
      }
      if(a[x]==0)
      {
            return solve(x+1,y);
      }
      if(dp[x][y]!=-1)
            return dp[x][y];
      int l=1,ans=0,ty=y;
      for(int i=0;i<f[x].size();i++)
      {
            if(ty&(1LL<<isP[f[x][i]]))
            {
                  ty&=~(1LL << isP[f[x][i]]);
            }
            else
            {
                  ty=ty|(1LL<<isP[f[x][i]]);
            }
      }
      //    debug2(y,f[x][0]);
      ans=(ans+(expo(2,a[x]-1,mod)*(solve(x+1,y)+solve(x+1,ty)))%mod)%mod;
      dp[x][y]=ans;
      return ans;
      /*for(int i=0;i<=a[x];i++)
      {
            int g=(((fac[a[x]]*(expo(fac[i],mod-2,mod)))%mod)*(expo(fac[a[x]-i],mod-2,mod)))%mod;
            if(i==0)
            {
                  ans=(ans+solve(x+1,y))%mod;
            }
            else if(y==0)
            {
                  if(i%2==0)
                  {
                        ans=(ans+(g*solve(x+1,y))%mod)%mod;
                  }
                  else
                  {
                        ans=(ans+(g*solve(x+1,ty))%mod)%mod;
                  }
            }
            else
            {
                  if(i%2==0)
                  {
                        ans=(ans+(g*solve(x+1,y))%mod)%mod;
                  }
                  else
                  {
                        ans=(ans+(g*solve(x+1,ty))%mod)%mod;
                  }
            }
      }
      d[make_pair(x,y)]=ans;
      return ans;*/
}
int32_t main()
{
   IOS;
   #ifndef ONLINE_JUDGE
   freopen("input.txt","r",stdin);
   freopen("output.txt","w",stdout);
   #endif
   /********************* Code starts here ***********************/
   cin>>n;
   for(int i=0;i<71;i++)
   {
      for(int j=0;j<=(1LL<<19);j++)
      {
            dp[i][j]=-1;
      }
   }
   int p=0;
   for(int i=2;i<=70;i++)
   {
      if(isPrime(i))
      {
            isP[i]=p++;
      }
   }
   //cout<<p<<endl;
   for(int i=2;i<=70;i++)
   {
      int k=i;
      for(int j=2;j*j<=i;j++)
      {
            int c=0;
            while(k%j==0)
            {
                  c++;
                  k=k/j;
            }
            if(c%2==1)
            {
                  f[i].pb(j);
            }
            if(i%j==0)
            {
                  int u=i/j;
                  if(isPrime(u))
                  {
                        c=0;
                        k=i;
                        while(k%u==0)
                        {
                              c++;
                              k=k/u;
                        }
                        if(c%2==1)
                        {
                              f[i].pb(u);
                        }
                  }
            }
      }
   }
   for(int i=2;i<=70;i++)
   {
      if(f[i].size()==0 && isPrime(i))
            f[i].pb(i);
   }
   p=1;

   for(int i=0;i<n;i++)
   {
      int x;
      cin>>x;
      a[x]++;
   }
   int ans=(solve(2,0)-1+mod)%mod;
   cout<<ans<<endl;
}


#define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl '\n'
#define INF (1LL<<25)
#define ff first
#define ss second
#define mod 1000000007
#define pb push_back
#define mp make_pair
//#define int long long
#define all(a) a.begin(), a.end()
#define inf (1LL<<61)
#define ull unsigned long long
#define debug1(x) cerr << #x << ": " << x <<'\n'
#define debug2(x, y) cerr << #x << ": " << x << '\t' << #y << ": " << y <<'\n'
#define debug3(x, y, z) cerr << #x << ": " << x << '\t' << #y << ": " << y << '\t' << #z << ": " << z <<'\n'
using namespace std;
int dx[]={1,0,-1,0};int dy[]={0,1,0,-1}; //4 Direction
//int dx[]={1,1,0,-1,-1,-1,0,1};int dy[]={0,1,1,1,0,-1,-1,-1};//8 direction
int gcd(int x,int y)
{
    if(y==0)
        return x;
    else
        return gcd(y,x%y);
}
int expo(int n,int m,int p)   //modULAR EXPONENTIATION
{
    int r=1;
    n=n%p;
    while(m>0)
    {
        if(m%2)
            r=(r*n)%p;
        n=(n*n)%p;
        m=m/2;
    }
    return r%p;
}
bool isPrime(int n)
{
    // Corner cases
    if (n <= 1)  return false;
    if (n <= 3)  return true;

    // This is checked so that we can skip
    // middle five numbers in below loop
    if (n%2 == 0 || n%3 == 0) return false;

    for (int i=5; i*i<=n; i=i+6)
        if (n%i == 0 || n%(i+2) == 0)
           return false;

    return true;
}
int n;
vector<int>a(71);
vector<int>f[76];
vector<int>isP(71);
int dp[71][(1<<19)+1];
int solve(int x,int y)
{
      if(x==71)
      {
            if(y==0)
            {
                  long long y=expo(2,a[1],mod);
                  return y;
            }
            return 0;
      }
      if(a[x]==0)
      {
            return solve(x+1,y);
      }
      if(dp[x][y]!=-1)
            return dp[x][y];
      long long l=1,ans=0,ty=y;
      for(int i=0;i<f[x].size();i++)
      {
            if(ty&(1LL<<isP[f[x][i]]))
            {
                  ty&=~(1LL << isP[f[x][i]]);
            }
            else
            {
                  ty=ty|(1LL<<isP[f[x][i]]);
            }
      }
      //    debug2(y,f[x][0]);
      ans=(ans+(expo(2,a[x]-1,mod)*((solve(x+1,y)+solve(x+1,ty))%mod))%mod)%mod;
      dp[x][y]=ans;
      return ans;
      /*for(int i=0;i<=a[x];i++)
      {
            int g=(((fac[a[x]]*(expo(fac[i],mod-2,mod)))%mod)*(expo(fac[a[x]-i],mod-2,mod)))%mod;
            if(i==0)
            {
                  ans=(ans+solve(x+1,y))%mod;
            }
            else if(y==0)
            {
                  if(i%2==0)
                  {
                        ans=(ans+(g*solve(x+1,y))%mod)%mod;
                  }
                  else
                  {
                        ans=(ans+(g*solve(x+1,ty))%mod)%mod;
                  }
            }
            else
            {
                  if(i%2==0)
                  {
                        ans=(ans+(g*solve(x+1,y))%mod)%mod;
                  }
                  else
                  {
                        ans=(ans+(g*solve(x+1,ty))%mod)%mod;
                  }
            }
      }
      d[make_pair(x,y)]=ans;
      return ans;*/
}
int32_t main()
{
   IOS;
   #ifndef ONLINE_JUDGE
   freopen("input.txt","r",stdin);
   freopen("output.txt","w",stdout);
   #endif
   /********************* Code starts here ***********************/
   cin>>n;
   for(int i=0;i<71;i++)
   {
      for(int j=0;j<=(1LL<<19);j++)
      {
            dp[i][j]=-1;
      }
   }
   int p=0;
   for(int i=2;i<=70;i++)
   {
      if(isPrime(i))
      {
            isP[i]=p++;
      }
   }
   //cout<<p<<endl;
   for(int i=2;i<=70;i++)
   {
      int k=i;
      for(int j=2;j*j<=i;j++)
      {
            int c=0;
            while(k%j==0)
            {
                  c++;
                  k=k/j;
            }
            if(c%2==1)
            {
                  f[i].pb(j);
            }
            if(i%j==0)
            {
                  int u=i/j;
                  if(isPrime(u))
                  {
                        c=0;
                        k=i;
                        while(k%u==0)
                        {
                              c++;
                              k=k/u;
                        }
                        if(c%2==1)
                        {
                              f[i].pb(u);
                        }
                  }
            }
      }
   }
   for(int i=2;i<=70;i++)
   {
      if(f[i].size()==0 && isPrime(i))
            f[i].pb(i);
   }
   p=1;

   for(int i=0;i<n;i++)
   {
      int x;
      cin>>x;
      a[x]++;
   }
   long long int ans=(solve(2,0)-1+mod)%mod;
   cout<<ans<<endl;
}


#define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl '\n'
#define INF (1LL<<25)
#define ff first
#define ss second
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define int long long
#define all(a) a.begin(), a.end()
#define inf (1LL<<61)
#define ull unsigned long long
#define debug1(x) cerr << #x << ": " << x <<'\n'
#define debug2(x, y) cerr << #x << ": " << x << '\t' << #y << ": " << y <<'\n'
#define debug3(x, y, z) cerr << #x << ": " << x << '\t' << #y << ": " << y << '\t' << #z << ": " << z <<'\n'
using namespace std;
int dx[]={1,0,-1,0};int dy[]={0,1,0,-1}; //4 Direction
//int dx[]={1,1,0,-1,-1,-1,0,1};int dy[]={0,1,1,1,0,-1,-1,-1};//8 direction
int gcd(int x,int y)
{
    if(y==0)
        return x;
    else
        return gcd(y,x%y);
}
int expo(int n,int m,int p)   //modULAR EXPONENTIATION
{
    int r=1;
    n=n%p;
    while(m>0)
    {
        if(m%2)
            r=(r*n)%p;
        n=(n*n)%p;
        m=m/2;
    }
    return r%p;
}
bool isPrime(int n)
{
    // Corner cases
    if (n <= 1)  return false;
    if (n <= 3)  return true;

    // This is checked so that we can skip
    // middle five numbers in below loop
    if (n%2 == 0 || n%3 == 0) return false;

    for (int i=5; i*i<=n; i=i+6)
        if (n%i == 0 || n%(i+2) == 0)
           return false;

    return true;
}
int n;
vector<int>a(71);
vector<int>f[76];
vector<int>fac(100005);
vector<int>isP(71);
int solve(int x,int y)
{
      if(x==71)
      {
            if(y==0||y==1)
            {
                  int y=expo(2,a[1],mod);
                  return y;
            }
            return 0;
      }
      if(a[x]==0)
      {
            return solve(x+1,y);
      }
      int l=1,ans=0,ty=y;
      for(int i=0;i<f[x].size();i++)
      {
            if(ty&(1LL<<isP[f[x][i]]))
            {
                  ty&=~(1LL << isP[f[x][i]]);
            }
            else
            {
                  ty=ty|(1LL<<isP[f[x][i]]);
            }
      }
      for(int i=0;i<=a[x];i++)
      {
            int g=(((fac[a[x]]*(expo(fac[i],mod-2,mod)))%mod)*(expo(fac[a[x]-i],mod-2,mod)))%mod;
            if(i==0)
            {
                  ans=(ans+solve(x+1,y))%mod;
            }
            else if(y==0)
            {
                  if(i%2==0)
                  {
                        ans=(ans+(g*solve(x+1,y))%mod)%mod;
                  }
                  else
                  {
                        ans=(ans+(g*solve(x+1,ty))%mod)%mod;
                  }
            }
            else
            {
                  if(i%2==0)
                  {
                        ans=(ans+(g*solve(x+1,y))%mod)%mod;
                  }
                  else
                  {
                        ans=(ans+(g*solve(x+1,ty))%mod)%mod;
                  }
            }
      }
      return ans;
}
int32_t main()
{
   IOS;
   #ifndef ONLINE_JUDGE
   freopen("input.txt","r",stdin);
   freopen("output.txt","w",stdout);
   #endif
   /********************* Code starts here ***********************/
   cin>>n;

   int p=1;
   for(int i=2;i<=70;i++)
   {
      if(isPrime(i))
      {
            isP[i]=p++;
      }
   }
   for(int i=2;i<=70;i++)
   {
      int k=i;
      for(int j=2;j*j<=i;j++)
      {
            int c=0;
            while(k%j==0)
            {
                  c++;
                  k=k/j;
            }
            if(c%2==1)
            {
                  f[i].pb(j);
            }
            if(i%j==0)
            {
                  int u=i/j;
                  if(isPrime(u))
                  {
                        c=0;
                        k=i;
                        while(k%u==0)
                        {
                              c++;
                              k=k/u;
                        }
                        if(c%2==1)
                        {
                              f[i].pb(u);
                        }
                  }
            }
      }
   }
   for(int i=2;i<=70;i++)
   {
      if(f[i].size()==0)
            f[i].pb(i);
   }
   fac[0]=1;
   p=1;
   for(int i=1;i<=100000;i++)
   {
      p=(p*i)%mod;
      fac[i]=p;
   }
   for(int i=0;i<n;i++)
   {
      int x;
      cin>>x;
      a[x]++;
   }
   int ans=(solve(2,1)-1+mod)%mod;
   cout<<ans<<endl;
}


#define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl '\n'
#define INF (1LL<<25)
#define ff first
#define ss second
#define mod 1000000007
#define pb push_back
#define mp make_pair
//#define int long long
#define all(a) a.begin(), a.end()
#define inf (1LL<<61)
#define ull unsigned long long
#define debug1(x) cerr << #x << ": " << x <<'\n'
#define debug2(x, y) cerr << #x << ": " << x << '\t' << #y << ": " << y <<'\n'
#define debug3(x, y, z) cerr << #x << ": " << x << '\t' << #y << ": " << y << '\t' << #z << ": " << z <<'\n'
using namespace std;
int dx[]={1,0,-1,0};int dy[]={0,1,0,-1}; //4 Direction
//int dx[]={1,1,0,-1,-1,-1,0,1};int dy[]={0,1,1,1,0,-1,-1,-1};//8 direction
int gcd(int x,int y)
{
    if(y==0)
        return x;
    else
        return gcd(y,x%y);
}
long long expo(long long  n,long long  m,long long p)   //modULAR EXPONENTIATION
{
    long long r=1;
    n=n%p;
    while(m>0)
    {
        if(m%2)
            r=(r*n)%p;
        n=(n*n)%p;
        m=m/2;
    }
    return r%p;
}
bool isPrime(int n)
{
    // Corner cases
    if (n <= 1)  return false;
    if (n <= 3)  return true;

    // This is checked so that we can skip
    // middle five numbers in below loop
    if (n%2 == 0 || n%3 == 0) return false;

    for (int i=5; i*i<=n; i=i+6)
        if (n%i == 0 || n%(i+2) == 0)
           return false;

    return true;
}
int n;
vector<int>a(71);
vector<int>f[76];
vector<int>isP(71);
int dp[71][(1<<19)+1];
int solve(int x,int y)
{
      if(x==71)
      {
            if(y==0)
            {
                  long long y=expo(2,a[1],mod);
                  return y;
            }
            return 0;
      }
      if(a[x]==0)
      {
            return solve(x+1,y);
      }
      if(dp[x][y]!=-1)
            return dp[x][y];
      long long l=1,ans=0,ty=y;
      for(int i=0;i<f[x].size();i++)
      {
            if(ty&(1LL<<isP[f[x][i]]))
            {
                  ty&=~(1LL << isP[f[x][i]]);
            }
            else
            {
                  ty=ty|(1LL<<isP[f[x][i]]);
            }
      }
      //    debug2(y,f[x][0]);
      long long o = expo(2,a[x]-1,mod);
      ans = ((o*solve(x+1,y))%mod + (o*solve(x+1,ty))%mod)%mod;
      dp[x][y]=ans;
      return ans;
      /*for(int i=0;i<=a[x];i++)
      {
            int g=(((fac[a[x]]*(expo(fac[i],mod-2,mod)))%mod)*(expo(fac[a[x]-i],mod-2,mod)))%mod;
            if(i==0)
            {
                  ans=(ans+solve(x+1,y))%mod;
            }
            else if(y==0)
            {
                  if(i%2==0)
                  {
                        ans=(ans+(g*solve(x+1,y))%mod)%mod;
                  }
                  else
                  {
                        ans=(ans+(g*solve(x+1,ty))%mod)%mod;
                  }
            }
            else
            {
                  if(i%2==0)
                  {
                        ans=(ans+(g*solve(x+1,y))%mod)%mod;
                  }
                  else
                  {
                        ans=(ans+(g*solve(x+1,ty))%mod)%mod;
                  }
            }
      }
      d[make_pair(x,y)]=ans;
      return ans;*/
}
int32_t main()
{
   IOS;
   #ifndef ONLINE_JUDGE
   freopen("input.txt","r",stdin);
   freopen("output.txt","w",stdout);
   #endif
   /********************* Code starts here ***********************/
   cin>>n;
   for(int i=0;i<71;i++)
   {
      for(int j=0;j<=(1LL<<19);j++)
      {
            dp[i][j]=-1;
      }
   }
   int p=0;
   for(int i=2;i<=70;i++)
   {
      if(isPrime(i))
      {
            isP[i]=p++;
      }
   }
   //cout<<p<<endl;
   for(int i=2;i<=70;i++)
   {
      int k=i;
      for(int j=2;j*j<=i;j++)
      {
            int c=0;
            while(k%j==0)
            {
                  c++;
                  k=k/j;
            }
            if(c%2==1)
            {
                  f[i].pb(j);
            }
            if(i%j==0)
            {
                  int u=i/j;
                  if(isPrime(u))
                  {
                        c=0;
                        k=i;
                        while(k%u==0)
                        {
                              c++;
                              k=k/u;
                        }
                        if(c%2==1)
                        {
                              f[i].pb(u);
                        }
                  }
            }
      }
   }
   for(int i=2;i<=70;i++)
   {
      if(f[i].size()==0 && isPrime(i))
            f[i].pb(i);
   }
   for(int i=0;i<n;i++)
   {
      int x;
      cin>>x;
      a[x]++;
   }
   long long int ans=(solve(2,0)-1+mod)%mod;
   cout<<ans<<endl;
}


#define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl '\n'
#define INF (1LL<<25)
#define ff first
#define ss second
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define int long long
#define all(a) a.begin(), a.end()
#define inf (1LL<<61)
#define ull unsigned long long
#define debug1(x) cerr << #x << ": " << x <<'\n'
#define debug2(x, y) cerr << #x << ": " << x << '\t' << #y << ": " << y <<'\n'
#define debug3(x, y, z) cerr << #x << ": " << x << '\t' << #y << ": " << y << '\t' << #z << ": " << z <<'\n'
using namespace std;
int dx[]={1,0,-1,0};int dy[]={0,1,0,-1}; //4 Direction
//int dx[]={1,1,0,-1,-1,-1,0,1};int dy[]={0,1,1,1,0,-1,-1,-1};//8 direction
int gcd(int x,int y)
{
    if(y==0)
        return x;
    else
        return gcd(y,x%y);
}
int expo(int n,int m,int p)   //modULAR EXPONENTIATION
{
    int r=1;
    n=n%p;
    while(m>0)
    {
        if(m%2)
            r=(r*n)%p;
        n=(n*n)%p;
        m=m/2;
    }
    return r%p;
}
bool isPrime(int n)
{
    // Corner cases
    if (n <= 1)  return false;
    if (n <= 3)  return true;

    // This is checked so that we can skip
    // middle five numbers in below loop
    if (n%2 == 0 || n%3 == 0) return false;

    for (int i=5; i*i<=n; i=i+6)
        if (n%i == 0 || n%(i+2) == 0)
           return false;

    return true;
}
int n;
vector<int>a(71);
vector<int>f[76];
vector<int>fac(100005);
vector<int>isP(71);
int dp[71][1<<19+1];
int solve(int x,int y)
{
      if(x==71)
      {
            if(y==0||y==1)
            {
                  int y=expo(2,a[1],mod);
                  return y;
            }
            return 0;
      }
      if(a[x]==0)
      {
            return solve(x+1,y);
      }
      if(dp[x][y]!=-1)
            return dp[x][y];
      int l=1,ans=0,ty=y;
      for(int i=0;i<f[x].size();i++)
      {
            if(ty&(1LL<<isP[f[x][i]]))
            {
                  ty&=~(1LL << isP[f[x][i]]);
            }
            else
            {
                  ty=ty|(1LL<<isP[f[x][i]]);
            }
      }
      ans=(ans+(expo(2,a[x]-1,mod)*(solve(x+1,y)+solve(x+1,ty)))%mod)%mod;
      dp[x][y]=ans;
      return ans;
      /*for(int i=0;i<=a[x];i++)
      {
            int g=(((fac[a[x]]*(expo(fac[i],mod-2,mod)))%mod)*(expo(fac[a[x]-i],mod-2,mod)))%mod;
            if(i==0)
            {
                  ans=(ans+solve(x+1,y))%mod;
            }
            else if(y==0)
            {
                  if(i%2==0)
                  {
                        ans=(ans+(g*solve(x+1,y))%mod)%mod;
                  }
                  else
                  {
                        ans=(ans+(g*solve(x+1,ty))%mod)%mod;
                  }
            }
            else
            {
                  if(i%2==0)
                  {
                        ans=(ans+(g*solve(x+1,y))%mod)%mod;
                  }
                  else
                  {
                        ans=(ans+(g*solve(x+1,ty))%mod)%mod;
                  }
            }
      }
      d[make_pair(x,y)]=ans;
      return ans;*/
}
int32_t main()
{
   IOS;
   #ifndef ONLINE_JUDGE
   freopen("input.txt","r",stdin);
   freopen("output.txt","w",stdout);
   #endif
   /********************* Code starts here ***********************/
   cin>>n;
   for(int i=0;i<71;i++)
   {
      for(int j=0;j<=(1LL<<19);j++)
      {
            dp[i][j]=-1;
      }
   }
   int p=1;
   for(int i=2;i<=70;i++)
   {
      if(isPrime(i))
      {
            isP[i]=p++;
      }
   }
   cout<<p<<endl;
   for(int i=2;i<=70;i++)
   {
      int k=i;
      for(int j=2;j*j<=i;j++)
      {
            int c=0;
            while(k%j==0)
            {
                  c++;
                  k=k/j;
            }
            if(c%2==1)
            {
                  f[i].pb(j);
            }
            if(i%j==0)
            {
                  int u=i/j;
                  if(isPrime(u))
                  {
                        c=0;
                        k=i;
                        while(k%u==0)
                        {
                              c++;
                              k=k/u;
                        }
                        if(c%2==1)
                        {
                              f[i].pb(u);
                        }
                  }
            }
      }
   }
   for(int i=2;i<=70;i++)
   {
      if(f[i].size()==0)
            f[i].pb(i);
   }
   fac[0]=1;
   p=1;
   for(int i=1;i<=100000;i++)
   {
      p=(p*i)%mod;
      fac[i]=p;
   }
   for(int i=0;i<n;i++)
   {
      int x;
      cin>>x;
      a[x]++;
   }
   int ans=(solve(2,1)-1+mod)%mod;
   cout<<ans<<endl;
}


#define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl '\n'
#define INF (1LL<<25)
#define ff first
#define ss second
#define mod 1000000007
#define pb push_back
#define mp make_pair
//#define int long long
#define all(a) a.begin(), a.end()
#define inf (1LL<<61)
#define ull unsigned long long
#define debug1(x) cerr << #x << ": " << x <<'\n'
#define debug2(x, y) cerr << #x << ": " << x << '\t' << #y << ": " << y <<'\n'
#define debug3(x, y, z) cerr << #x << ": " << x << '\t' << #y << ": " << y << '\t' << #z << ": " << z <<'\n'
using namespace std;
int dx[]={1,0,-1,0};int dy[]={0,1,0,-1}; //4 Direction
//int dx[]={1,1,0,-1,-1,-1,0,1};int dy[]={0,1,1,1,0,-1,-1,-1};//8 direction
int gcd(int x,int y)
{
    if(y==0)
        return x;
    else
        return gcd(y,x%y);
}
int expo(int n,int m,int p)   //modULAR EXPONENTIATION
{
    int r=1;
    n=n%p;
    while(m>0)
    {
        if(m%2)
            r=(r*n)%p;
        n=(n*n)%p;
        m=m/2;
    }
    return r%p;
}
bool isPrime(int n)
{
    // Corner cases
    if (n <= 1)  return false;
    if (n <= 3)  return true;

    // This is checked so that we can skip
    // middle five numbers in below loop
    if (n%2 == 0 || n%3 == 0) return false;

    for (int i=5; i*i<=n; i=i+6)
        if (n%i == 0 || n%(i+2) == 0)
           return false;

    return true;
}
int n;
vector<int>a(71);
vector<int>f[76];
vector<int>isP(71);
int dp[71][(1<<19)+1];
int solve(int x,int y)
{
      if(x==71)
      {
            if(y==0||y==1)
            {
                  int y=expo(2,a[1],mod);
                  return y;
            }
            return 0;
      }
      if(a[x]==0)
      {
            return solve(x+1,y);
      }
      if(dp[x][y]!=-1)
            return dp[x][y];
      int l=1,ans=0,ty=y;
      for(int i=0;i<f[x].size();i++)
      {
            if(ty&(1LL<<isP[f[x][i]]))
            {
                  ty&=~(1LL << isP[f[x][i]]);
            }
            else
            {
                  ty=ty|(1LL<<isP[f[x][i]]);
            }
      }
      ans=(ans+(expo(2,a[x]-1,mod)*(solve(x+1,y)+solve(x+1,ty)))%mod)%mod;
      dp[x][y]=ans;
      return ans;
      /*for(int i=0;i<=a[x];i++)
      {
            int g=(((fac[a[x]]*(expo(fac[i],mod-2,mod)))%mod)*(expo(fac[a[x]-i],mod-2,mod)))%mod;
            if(i==0)
            {
                  ans=(ans+solve(x+1,y))%mod;
            }
            else if(y==0)
            {
                  if(i%2==0)
                  {
                        ans=(ans+(g*solve(x+1,y))%mod)%mod;
                  }
                  else
                  {
                        ans=(ans+(g*solve(x+1,ty))%mod)%mod;
                  }
            }
            else
            {
                  if(i%2==0)
                  {
                        ans=(ans+(g*solve(x+1,y))%mod)%mod;
                  }
                  else
                  {
                        ans=(ans+(g*solve(x+1,ty))%mod)%mod;
                  }
            }
      }
      d[make_pair(x,y)]=ans;
      return ans;*/
}
int32_t main()
{
   IOS;
   #ifndef ONLINE_JUDGE
   freopen("input.txt","r",stdin);
   freopen("output.txt","w",stdout);
   #endif
   /********************* Code starts here ***********************/
   cin>>n;
   for(int i=0;i<71;i++)
   {
      for(int j=0;j<=(1LL<<19);j++)
      {
            dp[i][j]=-1;
      }
   }
   int p=1;
   for(int i=2;i<=70;i++)
   {
      if(isPrime(i))
      {
            isP[i]=p++;
      }
   }
   //cout<<p<<endl;
   for(int i=2;i<=70;i++)
   {
      int k=i;
      for(int j=2;j*j<=i;j++)
      {
            int c=0;
            while(k%j==0)
            {
                  c++;
                  k=k/j;
            }
            if(c%2==1)
            {
                  f[i].pb(j);
            }
            if(i%j==0)
            {
                  int u=i/j;
                  if(isPrime(u))
                  {
                        c=0;
                        k=i;
                        while(k%u==0)
                        {
                              c++;
                              k=k/u;
                        }
                        if(c%2==1)
                        {
                              f[i].pb(u);
                        }
                  }
            }
      }
   }
   for(int i=2;i<=70;i++)
   {
      if(f[i].size()==0)
            f[i].pb(i);
   }
   p=1;

   for(int i=0;i<n;i++)
   {
      int x;
      cin>>x;
      a[x]++;
   }
   int ans=(solve(2,1)-1+mod)%mod;
   cout<<ans<<endl;
}


#define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl '\n'
#define INF (1LL<<25)
#define ff first
#define ss second
#define mod 1000000007
#define pb push_back
#define mp make_pair
//#define int long long
#define all(a) a.begin(), a.end()
#define inf (1LL<<61)
#define ull unsigned long long
#define debug1(x) cerr << #x << ": " << x <<'\n'
#define debug2(x, y) cerr << #x << ": " << x << '\t' << #y << ": " << y <<'\n'
#define debug3(x, y, z) cerr << #x << ": " << x << '\t' << #y << ": " << y << '\t' << #z << ": " << z <<'\n'
using namespace std;
int dx[]={1,0,-1,0};int dy[]={0,1,0,-1}; //4 Direction
//int dx[]={1,1,0,-1,-1,-1,0,1};int dy[]={0,1,1,1,0,-1,-1,-1};//8 direction
int gcd(int x,int y)
{
    if(y==0)
        return x;
    else
        return gcd(y,x%y);
}
int expo(int n,int m,int p)   //modULAR EXPONENTIATION
{
    int r=1;
    n=n%p;
    while(m>0)
    {
        if(m%2)
            r=(r*n)%p;
        n=(n*n)%p;
        m=m/2;
    }
    return r%p;
}
bool isPrime(int n)
{
    // Corner cases
    if (n <= 1)  return false;
    if (n <= 3)  return true;

    // This is checked so that we can skip
    // middle five numbers in below loop
    if (n%2 == 0 || n%3 == 0) return false;

    for (int i=5; i*i<=n; i=i+6)
        if (n%i == 0 || n%(i+2) == 0)
           return false;

    return true;
}
int n;
vector<int>a(71);
vector<int>f[76];
vector<int>isP(71);
int dp[71][(1<<19)+1];
int solve(int x,int y)
{
      if(x==71)
      {
            if(y==0)
            {
                  long long y=expo(2,a[1],mod);
                  return y;
            }
            return 0;
      }
      if(a[x]==0)
      {
            return solve(x+1,y);
      }
      if(dp[x][y]!=-1)
            return dp[x][y];
      long long l=1,ans=0,ty=y;
      for(int i=0;i<f[x].size();i++)
      {
            if(ty&(1LL<<isP[f[x][i]]))
            {
                  ty&=~(1LL << isP[f[x][i]]);
            }
            else
            {
                  ty=ty|(1LL<<isP[f[x][i]]);
            }
      }
      //    debug2(y,f[x][0]);
      long long o = expo(2,a[x]-1,mod);
      ans = ((o*solve(x+1,y))%mod + (o*solve(x+1,ty))%mod)%mod;
      dp[x][y]=ans;
      return ans;
      /*for(int i=0;i<=a[x];i++)
      {
            int g=(((fac[a[x]]*(expo(fac[i],mod-2,mod)))%mod)*(expo(fac[a[x]-i],mod-2,mod)))%mod;
            if(i==0)
            {
                  ans=(ans+solve(x+1,y))%mod;
            }
            else if(y==0)
            {
                  if(i%2==0)
                  {
                        ans=(ans+(g*solve(x+1,y))%mod)%mod;
                  }
                  else
                  {
                        ans=(ans+(g*solve(x+1,ty))%mod)%mod;
                  }
            }
            else
            {
                  if(i%2==0)
                  {
                        ans=(ans+(g*solve(x+1,y))%mod)%mod;
                  }
                  else
                  {
                        ans=(ans+(g*solve(x+1,ty))%mod)%mod;
                  }
            }
      }
      d[make_pair(x,y)]=ans;
      return ans;*/
}
int32_t main()
{
   IOS;
   #ifndef ONLINE_JUDGE
   freopen("input.txt","r",stdin);
   freopen("output.txt","w",stdout);
   #endif
   /********************* Code starts here ***********************/
   cin>>n;
   for(int i=0;i<71;i++)
   {
      for(int j=0;j<=(1LL<<19);j++)
      {
            dp[i][j]=-1;
      }
   }
   int p=0;
   for(int i=2;i<=70;i++)
   {
      if(isPrime(i))
      {
            isP[i]=p++;
      }
   }
   //cout<<p<<endl;
   for(int i=2;i<=70;i++)
   {
      int k=i;
      for(int j=2;j*j<=i;j++)
      {
            int c=0;
            while(k%j==0)
            {
                  c++;
                  k=k/j;
            }
            if(c%2==1)
            {
                  f[i].pb(j);
            }
            if(i%j==0)
            {
                  int u=i/j;
                  if(isPrime(u))
                  {
                        c=0;
                        k=i;
                        while(k%u==0)
                        {
                              c++;
                              k=k/u;
                        }
                        if(c%2==1)
                        {
                              f[i].pb(u);
                        }
                  }
            }
      }
   }
   for(int i=2;i<=70;i++)
   {
      if(f[i].size()==0 && isPrime(i))
            f[i].pb(i);
   }
   p=1;

   for(int i=0;i<n;i++)
   {
      int x;
      cin>>x;
      a[x]++;
   }
   long long int ans=(solve(2,0)-1+mod)%mod;
   cout<<ans<<endl;
}


#define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl '\n'
#define INF (1LL<<25)
#define ff first
#define ss second
#define mod 1000000007
#define pb push_back
#define mp make_pair
//#define int long long
#define all(a) a.begin(), a.end()
#define inf (1LL<<61)
#define ull unsigned long long
#define debug1(x) cerr << #x << ": " << x <<'\n'
#define debug2(x, y) cerr << #x << ": " << x << '\t' << #y << ": " << y <<'\n'
#define debug3(x, y, z) cerr << #x << ": " << x << '\t' << #y << ": " << y << '\t' << #z << ": " << z <<'\n'
using namespace std;
int dx[]={1,0,-1,0};int dy[]={0,1,0,-1}; //4 Direction
//int dx[]={1,1,0,-1,-1,-1,0,1};int dy[]={0,1,1,1,0,-1,-1,-1};//8 direction
int gcd(int x,int y)
{
    if(y==0)
        return x;
    else
        return gcd(y,x%y);
}
int expo(int n,int m,int p)   //modULAR EXPONENTIATION
{
    int r=1;
    n=n%p;
    while(m>0)
    {
        if(m%2)
            r=(r*n)%p;
        n=(n*n)%p;
        m=m/2;
    }
    return r%p;
}
bool isPrime(int n)
{
    // Corner cases
    if (n <= 1)  return false;
    if (n <= 3)  return true;

    // This is checked so that we can skip
    // middle five numbers in below loop
    if (n%2 == 0 || n%3 == 0) return false;

    for (int i=5; i*i<=n; i=i+6)
        if (n%i == 0 || n%(i+2) == 0)
           return false;

    return true;
}
int n;
vector<int>a(71);
vector<int>f[76];
vector<int>isP(71);
int dp[71][1<<19+1];
int solve(int x,int y)
{
      if(x==71)
      {
            if(y==0||y==1)
            {
                  int y=expo(2,a[1],mod);
                  return y;
            }
            return 0;
      }
      if(a[x]==0)
      {
            return solve(x+1,y);
      }
      if(dp[x][y]!=-1)
            return dp[x][y];
      int l=1,ans=0,ty=y;
      for(int i=0;i<f[x].size();i++)
      {
            if(ty&(1LL<<isP[f[x][i]]))
            {
                  ty&=~(1LL << isP[f[x][i]]);
            }
            else
            {
                  ty=ty|(1LL<<isP[f[x][i]]);
            }
      }
      ans=(ans+(expo(2,a[x]-1,mod)*(solve(x+1,y)+solve(x+1,ty)))%mod)%mod;
      dp[x][y]=ans;
      return ans;
      /*for(int i=0;i<=a[x];i++)
      {
            int g=(((fac[a[x]]*(expo(fac[i],mod-2,mod)))%mod)*(expo(fac[a[x]-i],mod-2,mod)))%mod;
            if(i==0)
            {
                  ans=(ans+solve(x+1,y))%mod;
            }
            else if(y==0)
            {
                  if(i%2==0)
                  {
                        ans=(ans+(g*solve(x+1,y))%mod)%mod;
                  }
                  else
                  {
                        ans=(ans+(g*solve(x+1,ty))%mod)%mod;
                  }
            }
            else
            {
                  if(i%2==0)
                  {
                        ans=(ans+(g*solve(x+1,y))%mod)%mod;
                  }
                  else
                  {
                        ans=(ans+(g*solve(x+1,ty))%mod)%mod;
                  }
            }
      }
      d[make_pair(x,y)]=ans;
      return ans;*/
}
int32_t main()
{
   IOS;
   #ifndef ONLINE_JUDGE
   freopen("input.txt","r",stdin);
   freopen("output.txt","w",stdout);
   #endif
   /********************* Code starts here ***********************/
   cin>>n;
   for(int i=0;i<71;i++)
   {
      for(int j=0;j<=(1LL<<19);j++)
      {
            dp[i][j]=-1;
      }
   }
   int p=1;
   for(int i=2;i<=70;i++)
   {
      if(isPrime(i))
      {
            isP[i]=p++;
      }
   }
   //cout<<p<<endl;
   for(int i=2;i<=70;i++)
   {
      int k=i;
      for(int j=2;j*j<=i;j++)
      {
            int c=0;
            while(k%j==0)
            {
                  c++;
                  k=k/j;
            }
            if(c%2==1)
            {
                  f[i].pb(j);
            }
            if(i%j==0)
            {
                  int u=i/j;
                  if(isPrime(u))
                  {
                        c=0;
                        k=i;
                        while(k%u==0)
                        {
                              c++;
                              k=k/u;
                        }
                        if(c%2==1)
                        {
                              f[i].pb(u);
                        }
                  }
            }
      }
   }
   for(int i=2;i<=70;i++)
   {
      if(f[i].size()==0)
            f[i].pb(i);
   }
   p=1;

   for(int i=0;i<n;i++)
   {
      int x;
      cin>>x;
      a[x]++;
   }
   int ans=(solve(2,1)-1+mod)%mod;
   cout<<ans<<endl;
}


#define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl '\n'
#define INF (1LL<<25)
#define ff first
#define ss second
#define mod 1000000007
#define pb push_back
#define mp make_pair
//#define int long long
#define all(a) a.begin(), a.end()
#define inf (1LL<<61)
#define ull unsigned long long
#define debug1(x) cerr << #x << ": " << x <<'\n'
#define debug2(x, y) cerr << #x << ": " << x << '\t' << #y << ": " << y <<'\n'
#define debug3(x, y, z) cerr << #x << ": " << x << '\t' << #y << ": " << y << '\t' << #z << ": " << z <<'\n'
using namespace std;
int dx[]={1,0,-1,0};int dy[]={0,1,0,-1}; //4 Direction
//int dx[]={1,1,0,-1,-1,-1,0,1};int dy[]={0,1,1,1,0,-1,-1,-1};//8 direction
int gcd(int x,int y)
{
    if(y==0)
        return x;
    else
        return gcd(y,x%y);
}
int expo(int n,int m,int p)   //modULAR EXPONENTIATION
{
    int r=1;
    n=n%p;
    while(m>0)
    {
        if(m%2)
            r=(r*n)%p;
        n=(n*n)%p;
        m=m/2;
    }
    return r%p;
}
bool isPrime(int n)
{
    // Corner cases
    if (n <= 1)  return false;
    if (n <= 3)  return true;

    // This is checked so that we can skip
    // middle five numbers in below loop
    if (n%2 == 0 || n%3 == 0) return false;

    for (int i=5; i*i<=n; i=i+6)
        if (n%i == 0 || n%(i+2) == 0)
           return false;

    return true;
}
int n;
vector<int>a(71);
vector<int>f[76];
vector<int>isP(71);
int dp[71][(1<<19)+1];
int solve(int x,int y)
{
      if(x==71)
      {
            if(y==0)
            {
                  int y=expo(2,a[1],mod);
                  return y;
            }
            return 0;
      }
      if(a[x]==0)
      {
            return solve(x+1,y);
      }
      if(dp[x][y]!=-1)
            return dp[x][y];
      int l=1,ans=0,ty=y;
      for(int i=0;i<f[x].size();i++)
      {
            if(ty&(1LL<<isP[f[x][i]]))
            {
                  ty&=~(1LL << isP[f[x][i]]);
            }
            else
            {
                  ty=ty|(1LL<<isP[f[x][i]]);
            }
      }
      ans=(ans+(expo(2,a[x]-1,mod)*(solve(x+1,y)+solve(x+1,ty)))%mod)%mod;
      dp[x][y]=ans;
      return ans;
      /*for(int i=0;i<=a[x];i++)
      {
            int g=(((fac[a[x]]*(expo(fac[i],mod-2,mod)))%mod)*(expo(fac[a[x]-i],mod-2,mod)))%mod;
            if(i==0)
            {
                  ans=(ans+solve(x+1,y))%mod;
            }
            else if(y==0)
            {
                  if(i%2==0)
                  {
                        ans=(ans+(g*solve(x+1,y))%mod)%mod;
                  }
                  else
                  {
                        ans=(ans+(g*solve(x+1,ty))%mod)%mod;
                  }
            }
            else
            {
                  if(i%2==0)
                  {
                        ans=(ans+(g*solve(x+1,y))%mod)%mod;
                  }
                  else
                  {
                        ans=(ans+(g*solve(x+1,ty))%mod)%mod;
                  }
            }
      }
      d[make_pair(x,y)]=ans;
      return ans;*/
}
int32_t main()
{
   IOS;
   #ifndef ONLINE_JUDGE
   freopen("input.txt","r",stdin);
   freopen("output.txt","w",stdout);
   #endif
   /********************* Code starts here ***********************/
   cin>>n;
   for(int i=0;i<71;i++)
   {
      for(int j=0;j<=(1LL<<19);j++)
      {
            dp[i][j]=-1;
      }
   }
   int p=0;
   for(int i=2;i<=70;i++)
   {
      if(isPrime(i))
      {
            isP[i]=p++;
      }
   }
   //cout<<p<<endl;
   for(int i=2;i<=70;i++)
   {
      int k=i;
      for(int j=2;j*j<=i;j++)
      {
            int c=0;
            while(k%j==0)
            {
                  c++;
                  k=k/j;
            }
            if(c%2==1)
            {
                  f[i].pb(j);
            }
            if(i%j==0)
            {
                  int u=i/j;
                  if(isPrime(u))
                  {
                        c=0;
                        k=i;
                        while(k%u==0)
                        {
                              c++;
                              k=k/u;
                        }
                        if(c%2==1)
                        {
                              f[i].pb(u);
                        }
                  }
            }
      }
   }
   for(int i=2;i<=70;i++)
   {
      if(f[i].size()==0)
            f[i].pb(i);
   }
   p=1;

   for(int i=0;i<n;i++)
   {
      int x;
      cin>>x;
      a[x]++;
   }
   int ans=(solve(2,1)-1+mod)%mod;
   cout<<ans<<endl;
}