#include using i32 = std::int32_t; using u32 = std::uint32_t; using i64 = std::int64_t; using u64 = std::uint64_t; using i128 = __int128_t; using u128 = __uint128_t; using isize = std::ptrdiff_t; using usize = std::size_t; class rep { struct Iter { usize itr; constexpr Iter(const usize pos) noexcept: itr(pos) { } constexpr void operator ++ () noexcept { ++itr; } constexpr bool operator != (const Iter& other) const noexcept { return itr != other.itr; } constexpr usize operator * () const noexcept { return itr; } }; const Iter first, last; public: explicit constexpr rep(const usize first, const usize last) noexcept: first(first), last(std::max(first, last)) { } constexpr Iter begin() const noexcept { return first; } constexpr Iter end() const noexcept { return last; } }; template using Vec = std::vector; constexpr usize SIZE = 1 << 10; void F_main() { usize N; std::cin >> N; Vec A(N); for (auto &x: A) { std::cin >> x; } std::array from_and{}; std::array can{}; std::set from_plus; u32 sum = 0; from_and[0] = can[0] = true; from_plus.insert(0); for (const auto x: A) { { std::array next{}; for (auto i: rep(0, SIZE)) { if (can[i]) { next[i & x] = true; } } from_and = std::move(next); } { std::array next{}; for (auto i: rep(0, SIZE)) { if (can[i]) { next[(i + x) & (SIZE - 1)] = true; next[i & x] = true; } } can = std::move(next); } sum += x; usize ans = 0; // for (const auto y: from_plus) { // const auto z = sum - y; // if (z >= SIZE || !from_and[z]) { // ans += 1; // } // } { usize idx = 0; for (auto itr = from_plus.rbegin(); itr != from_plus.rend(); ++itr) { const auto x = sum - *itr; if (x >= SIZE) { break; } if (!from_and[x]) { ans += 1; } idx += 1; } ans += from_plus.size() - idx; } for (auto i: rep(0, SIZE)) { if (from_and[i]) { ans += 1; from_plus.insert(sum - i); } } std::cout << ans << '\n'; } return; } int main() { std::ios_base::sync_with_stdio(false); std::cin.tie(nullptr); F_main(); return 0; }