#define STOPIT #include #define loop(n) for (lint ngtkana_is_genius = 0; ngtkana_is_genius < lint(n); ngtkana_is_genius++) #define rep(i, begin, end) for(lint i = lint(begin); i < lint(end); i++) #define all(v) v.begin(), v.end() #define rand(l, r) std::uniform_int_distribution<>(l, r)(mt) using lint = long long; auto mt = std::mt19937_64(std::random_device{}()); auto cmn = [](auto& a, auto b){if (a > b) {a = b; return true;} return false;}; auto cmx = [](auto& a, auto b){if (a < b) {a = b; return true;} return false;}; void debug_impl() { std::cerr << std::endl; } template void debug_impl(Head head, Tail... tail){ std::cerr << " " << head; debug_impl(tail...); } #ifndef STOPIT #define debug(...)\ std::cerr << std::boolalpha << "[" << #__VA_ARGS__ << "]:";\ debug_impl(__VA_ARGS__);\ std::cerr << std::noboolalpha; #else #define debug 0; #endif template < typename Container, typename Value = typename Container::value_type, std::enable_if_t::value, std::nullptr_t> = nullptr> std::istream& operator>> (std::istream& is, Container& v) { for (auto & x : v) { is >> x; } return is; } template < typename Container, typename Value = typename Container::value_type, std::enable_if_t::value, std::nullptr_t> = nullptr > std::ostream& operator<< (std::ostream& os, Container const& v) { os << "{"; for (auto it = v.begin(); it != v.end(); it++) {os << (it != v.begin() ? "," : "") << *it;} return os << "}"; } template < template < typename ... > class Tuple, typename... Args, std::size_t ... Inds, std::size_t = std::tuple_size< Tuple < Args ... > >::value > std::istream& tuple_input_impl(std::istream& os, Tuple& tuple, std::integer_sequence) { (void)std::initializer_list{((void)(os >> std::get< Inds >(tuple)), 0)...}; return os; } template < template < typename ... > class Tuple, typename... Args, std::size_t = std::tuple_size< Tuple < Args ... > >::value > std::istream& operator>> (std::istream& os, Tuple& tuple) { return tuple_input_impl(os, tuple, std::index_sequence_for()); } template < template < typename ... > class Tuple, typename... Args, std::size_t ... Inds, std::size_t = std::tuple_size< Tuple < Args ... > >::value > std::ostream& tuple_output_impl(std::ostream& os, const Tuple& tuple, std::integer_sequence) { os << "("; (void)std::initializer_list{((void)(os << (Inds > 0 ? "," : "") << std::get< Inds >(tuple)), 0)...}; return os << ")"; } template < template < typename ... > class Tuple, typename... Args, std::size_t = std::tuple_size< Tuple < Args ... > >::value > std::ostream& operator<< (std::ostream& os, const Tuple& tuple) { return tuple_output_impl(os, tuple, std::index_sequence_for()); } inline auto divisors(lint x) { std::vector< lint > ret; std::stack < lint > stk; for (auto i = 1; i * i <= x; i++) { if (x % i == 0) { ret.emplace_back(i); if (i * i < x) { stk.emplace(x / i); } } } while (!stk.empty()) { ret.emplace_back(stk.top()), stk.pop(); } return ret; } int main() { std::cin.tie(0); std::cin.sync_with_stdio(false); lint n; std::cin >> n; std::vector< lint > a(n); std::cin >> a; std::sort(all(a)); std::map< lint, lint > map; for (auto x : a) { auto divs = divisors(x); for (auto y : divs) { map[y]++; } } std::vector< lint > pow2(n + 1, 1); rep(i, 1, n + 1) { pow2.at(i) = pow2.at(i - 1) * 2; } auto cal = [&] (auto k) { return pow2.at(k) - 1; }; std::map< lint, lint, std::greater< lint > > dp; for (auto pair : map) { lint x, k; std::tie(x, k) = pair; dp[x] += cal(k); } debug(dp); auto now = std::numeric_limits< lint >::max(); while (1 < now) { auto lb = dp.upper_bound(now); lint x = lb->first; lint val = lb->second; debug(x, val); for (auto d : divisors(x)) { if (d == x) continue; dp[d] -= val; } now = x; } debug(dp); lint ret = dp.at(1); std::cout << ret << std::endl; return 0; }