import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } real readReal() { return readToken.to!real; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } struct ModInt(int M_) { import std.conv : to; alias M = M_; int x; this(ModInt a) { x = a.x; } this(long a) { x = cast(int)(a % M); if (x < 0) x += M; } ref ModInt opAssign(long a) { return (this = ModInt(a)); } ref ModInt opOpAssign(string op)(ModInt a) { static if (op == "+") { x += a.x; if (x >= M) x -= M; } else static if (op == "-") { x -= a.x; if (x < 0) x += M; } else static if (op == "*") { x = cast(int)((cast(long)(x) * a.x) % M); } else static if (op == "/") { this *= a.inv(); } else static assert(false); return this; } ref ModInt opOpAssign(string op)(long a) { static if (op == "^^") { if (a < 0) return (this = inv()^^(-a)); ModInt t2 = this, te = ModInt(1); for (long e = a; e > 0; e >>= 1) { if (e & 1) te *= t2; t2 *= t2; } x = cast(int)(te.x); return this; } else return mixin("this " ~ op ~ "= ModInt(a)"); } ModInt inv() const { int a = x, b = M, y = 1, z = 0, t; for (; ; ) { t = a / b; a -= t * b; if (a == 0) { assert(b == 1 || b == -1); return ModInt(b * z); } y -= t * z; t = b / a; b -= t * a; if (b == 0) { assert(a == 1 || a == -1); return ModInt(a * y); } z -= t * y; } } ModInt opUnary(string op: "-")() const { return ModInt(-x); } ModInt opBinary(string op, T)(T a) const { return mixin("ModInt(this) " ~ op ~ "= a"); } ModInt opBinaryRight(string op)(long a) const { return mixin("ModInt(a) " ~ op ~ "= this"); } bool opCast(T: bool)() const { return (x != 0); } string toString() const { return x.to!string; } } enum MO0 = 10^^9 + 403; enum MO1 = 10^^9 + 409; enum MO2 = 10^^9 + 411; enum MO3 = 10^^9 + 427; enum E = 10; enum MASK = (1 << E) - 1; void main() { try { for (; ; ) { const N = readInt(); auto A = new int[N]; foreach (i; 0 .. N) { A[i] = readInt(); } debug { writeln("A = ", A); } auto tail0 = new ModInt!MO0[N + 1]; auto tail1 = new ModInt!MO1[N + 1]; auto tail2 = new ModInt!MO2[N + 1]; auto tail3 = new ModInt!MO3[N + 1]; tail0[N] = 1; tail1[N] = 1; tail2[N] = 1; tail3[N] = 1; foreach_reverse (i; 0 .. N) { const a = (A[i] == 0) ? 1 : A[i]; tail0[i] = a * tail0[i + 1]; tail1[i] = a * tail1[i + 1]; tail2[i] = a * tail2[i + 1]; tail3[i] = a * tail3[i + 1]; } bool zero; long[long] app; { const p0 = 1 * tail0[0]; const p1 = 1 * tail1[0]; const key = cast(long)(p0.x) << 30 | p1.x; app[key] = true; } auto crt = new bool[1 << E]; crt[1] = 1; foreach (i; 0 .. N) { auto nxt = new bool[1 << E]; foreach (u; 0 .. 1 << E) { if (crt[u]) { nxt[(u * A[i]) & MASK] = true; nxt[u & A[i]] = true; { const v = u & A[i]; if (v == 0) { zero = true; } else { const p0 = v * tail0[i + 1]; const p1 = v * tail0[i + 1]; const key = cast(long)(p0.x) << 30 | p1.x; app[key] = true; } } } } crt = nxt; if (A[i] == 0) { zero = true; app.clear; } int ans; ans += (zero ? 1 : 0); ans += app.length; writeln(ans); } } } catch (EOFException e) { } }