#include <bits/stdc++.h>
using namespace std;
const long long INF = ((long long)1 << 31) - 1;
const long long DINF = (long long)1e20;
const long long UNION_FIND_MAX = 100000;
const long long SEGMENT_TREE_MAX = (1 << 18) - 1;
const long long MAX_FLOW_MAX_V = 10000;
const long long MIN_COST_FLOW_MAX_V = 10000;
const long long BIPARTITE_MATCHING_MAX_V = 10000;
const long long DIJKSTRA_MAX_V = 1000000;
template <typename T>
T tmin(T a, T b) {
  return a > b ? b : a;
};
template <typename T>
T tmax(T a, T b) {
  return a > b ? a : b;
};
template <typename T>
T tadd(T a, T b) {
  return a + b;
};
template <typename T>
T tmul(T a, T b) {
  return a * b;
};
template <typename T>
T tpow(T a, T b) {
  return a * b;
};
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long lmin(long long a, long long b) { return a > b ? b : a; };
long long lmax(long long a, long long b) { return a > b ? a : b; };
class Dijkstra {
 public:
  struct edge {
    long long to, cost;
  };
  long long V;
  vector<edge> G[DIJKSTRA_MAX_V];
  long long d[DIJKSTRA_MAX_V];
  priority_queue<pair<long long, long long>,
                 vector<pair<long long, long long> >,
                 greater<pair<long long, long long> > >
      que;
  Dijkstra() {}
  Dijkstra(long long v) { init(v); }
  void init(long long v) {
    V = v;
    for (long long i = 0; i < v; i++) {
      G[i].clear();
    }
  }
  void search(long long from) {
    for (long long i = 0; i < V; i++) d[i] = INF;
    d[from] = 0;
    que.push(pair<long long, long long>(0, from));
    while (!que.empty()) {
      pair<long long, long long> p = que.top();
      que.pop();
      long long b = p.second;
      long long c = p.first;
      if (d[b] <= c) continue;
      for (long long i = 0; i < G[b].size(); i++) {
        edge e = G[b][i];
        long long nc = c + e.cost;
        long long nt = e.to;
        if (d[nt] > nc)
          que.push(pair<long long, long long>(nc, nt)), d[nt] = nc;
      }
    }
  }
};
template <typename T>
struct Matrix {
  long long x, y;
  vector<vector<T> > d;
  Matrix(long long _y, long long _x = -1) {
    if (_x == -1) _x = _y;
    x = _x, y = _y;
    for (int i = 0; i < y; i++)
      for (int j = 0; j < x; j++) d[i][j] = 0;
  }
  void unit() {
    for (int i = 0; i < y; i++)
      for (int j = 0; j < x; j++) d[i][j] = i == j ? 1 : 0;
  }
  Matrix copy() {
    Matrix m(y, x);
    for (int i = 0; i < y; i++)
      for (int j = 0; j < x; j++) m.d[i][j] = d[i][j];
    return m;
  }
  Matrix<T> operator+(Matrix<T> &t) {
    Matrix<T> m(y, x);
    for (int i = 0; i < y; i++)
      for (int j = 0; j < x; j++) m.d[i][j] = d[i][j] + t.d[i][j];
    return m;
  }
  Matrix<T> operator-(Matrix<T> &t) {
    Matrix<T> m(y, x);
    for (int i = 0; i < y; i++)
      for (int j = 0; j < x; j++) m.d[i][j] = d[i][j] - t.d[i][j];
    return m;
  }
  Matrix<T> operator*(T t) {
    Matrix<T> m(y, x);
    for (int i = 0; i < y; i++)
      for (int j = 0; j < x; j++) m.d[i][j] = d[i][j] * t;
    return m;
  }
  Matrix<T> det(Matrix<T> &t) {
    Matrix<T> m(y, x);
    for (int i = 0; i < y; i++)
      for (int j = 0; j < x; j++)
        for (int k = 0; k < t.x; k++) m.d[i][j] += d[i][k] * t.d[k][j];
    return m;
  }
};
template <typename T>
class Zip {
  vector<T> d;
  bool flag;

 public:
  Zip() { flag = false; }
  void add(T x) {
    d.push_back(x);
    flag = true;
  }
  long long getNum(T x) {
    if (flag) {
      sort(d.begin(), d.end());
      d.erase(unique(d.begin(), d.end()), d.end());
      flag = false;
    }
    return lower_bound(d.begin(), d.end(), x) - d.begin();
  }
  long long size() { return (long long)d.size(); }
};
class UnionFind {
  long long par[UNION_FIND_MAX];
  long long rank[UNION_FIND_MAX];

 public:
  void init(long long n) {
    for (long long i = 0; i < n; i++) par[i] = i, rank[i] = 0;
  }
  UnionFind(long long n) { init(n); }
  long long findRoot(long long x) {
    if (par[x] == x) return x;
    return par[x] = findRoot(par[x]);
  }
  void merge(long long x, long long y) {
    x = findRoot(x);
    y = findRoot(y);
    if (x == y) return;
    if (rank[x] < rank[y]) {
      par[x] = y;
    } else {
      par[y] = x;
      if (rank[x] == rank[y]) rank[x]++;
    }
  }
  bool isSame(long long x, long long y) { return findRoot(x) == findRoot(y); }
};
template <typename T>
class UnionFindT {
  long long par[UNION_FIND_MAX];
  long long rank[UNION_FIND_MAX];
  T weight[UNION_FIND_MAX];

 public:
  void init(long long n, T w) {
    for (long long i = 0; i < n; i++) par[i] = i, rank[i] = 0, weight[i] = w;
  }
  UnionFindT(long long n, T w) { init(n, w); }
  long long findRoot(long long x) {
    if (par[x] == x) return x;
    weight[x] += weight[par[x]];
    return par[x] = findRoot(par[x]);
  }
  T getWeight(long long x) {
    findRoot(x);
    return weight[x];
  }
  bool merge(long long x, long long y, T w) {
    w += weight(x);
    w -= weight(y);
    x = findRoot(x);
    y = findRoot(y);
    if (x == y) return false;
    if (rank[x] < rank[y]) {
      par[x] = y;
      weight[x] = -w;
    } else {
      par[y] = x;
      weight[y] = w;
      if (rank[x] == rank[y]) rank[x]++;
    }
    return true;
  }
  T diff(long long x, long long y) { return weight(y) - weight(x); }
  bool isSame(long long x, long long y) { return findRoot(x) == findRoot(y); }
};
template <typename T>
struct SegmentTree {
  long long n;
  T dat[SEGMENT_TREE_MAX];
  function<T(T, T)> acc;
  T out;
  SegmentTree(function<T(T, T)> func, T overNum) {
    acc = func;
    out = overNum;
  }
  void init(long long _n) {
    n = 1;
    while (n < _n) n *= 2;
    for (long long i = 0; i < 2 * n - 1; i++) dat[i] = out;
  }
  void nodeUpdate(long long k, T d) {
    k += n - 1;
    dat[k] = d;
    while (k > 0) {
      k = (k - 1) / 2;
      dat[k] = acc(dat[k * 2 + 1], dat[k * 2 + 2]);
    }
  }
  T rangeQuery(long long a, long long b) {
    return tempRangeQuery(a, b, 0, 0, n);
  }

 private:
  T tempRangeQuery(const long long &a, const long long &b, long long k,
                   long long l, long long r) {
    if (r <= a || b <= l) return out;
    if (a <= l && r <= b) return dat[k];
    T vl = tempRangeQuery(a, b, k * 2 + 1, l, (l + r) / 2);
    T vr = tempRangeQuery(a, b, k * 2 + 2, (l + r) / 2, r);
    return acc(vl, vr);
  }
};
class MaxFlow {
 public:
  struct edge {
    long long to, cap, rev;
  };
  vector<edge> G[MAX_FLOW_MAX_V];
  bool used[MAX_FLOW_MAX_V];
  long long level[MAX_FLOW_MAX_V];
  long long iter[MAX_FLOW_MAX_V];
  void init() {
    for (long long i = 0; i < MAX_FLOW_MAX_V; i++) {
      G[i].clear();
    }
  }
  void add_edge(long long from, long long to, long long cap) {
    G[from].push_back((edge){to, cap, (long long)G[to].size()});
    G[to].push_back((edge){from, 0, (long long)G[from].size() - 1});
  }
  void add_undirected_edge(long long e1, long long e2, long long cap) {
    G[e1].push_back((edge){e2, cap, (long long)G[e2].size()});
    G[e2].push_back((edge){e1, cap, (long long)G[e1].size() - 1});
  }
  long long dfs(long long v, long long t, long long f) {
    if (v == t) return f;
    used[v] = true;
    for (long long i = 0; i < (long long)G[v].size(); i++) {
      edge &e = G[v][i];
      if (!used[e.to] && e.cap > 0) {
        long long d = dfs(e.to, t, min(f, e.cap));
        if (d > 0) {
          e.cap -= d;
          G[e.to][e.rev].cap += d;
          return d;
        }
      }
    }
    return 0;
  }
  long long max_flow(long long s, long long t) {
    long long flow = 0;
    while (1) {
      memset(used, 0, sizeof(used));
      long long f = dfs(s, t, INF);
      if (f == 0) return flow;
      flow += f;
    }
  }
  void bfs(long long s) {
    memset(level, -1, sizeof(level));
    queue<long long> que;
    level[s] = 0;
    que.push(s);
    while (!que.empty()) {
      long long v = que.front();
      que.pop();
      for (long long i = 0; i < (long long)G[v].size(); i++) {
        edge &e = G[v][i];
        if (e.cap > 0 && level[e.to] < 0) {
          level[e.to] = level[v] + 1;
          que.push(e.to);
        }
      }
    }
  }
  long long dinic_dfs(long long v, long long t, long long f) {
    if (v == t) return f;
    for (long long &i = iter[v]; i < (long long)G[v].size(); i++) {
      edge &e = G[v][i];
      if (e.cap > 0 && level[v] < level[e.to]) {
        long long d = dinic_dfs(e.to, t, min(f, e.cap));
        if (d > 0) {
          e.cap -= d;
          G[e.to][e.rev].cap += d;
          return d;
        }
      }
    }
    return 0;
  }
  long long dinic(long long s, long long t) {
    long long flow = 0;
    while (1) {
      bfs(s);
      if (level[t] < 0) return flow;
      memset(iter, 0, sizeof(iter));
      long long f;
      while ((f = dinic_dfs(s, t, INF)) > 0) {
        flow += f;
      }
    }
  }
};
class BipartiteMatching {
 public:
  long long V;
  vector<long long> G[BIPARTITE_MATCHING_MAX_V];
  long long match[BIPARTITE_MATCHING_MAX_V];
  bool used[BIPARTITE_MATCHING_MAX_V];
  BipartiteMatching(long long v) { V = v; }
  void init(long long v) {
    V = v;
    for (long long i = 0; i < BIPARTITE_MATCHING_MAX_V; i++) {
      G[i].clear();
    }
  }
  void add_edge(long long u, long long v) {
    G[u].push_back(v);
    G[v].push_back(u);
  }
  bool dfs(long long v) {
    used[v] = true;
    for (long long i = 0; i < (long long)G[v].size(); i++) {
      long long u = G[v][i], w = match[u];
      if (w < 0 || !used[w] && dfs(w)) {
        match[v] = u;
        match[u] = v;
        return true;
      }
    }
    return false;
  }
  long long max_matching() {
    long long res = 0;
    memset(match, -1, sizeof(match));
    for (long long v = 0; v < V; v++) {
      if (match[v] < 0) {
        memset(used, 0, sizeof(used));
        if (dfs(v)) {
          res++;
        }
      }
    }
    return res;
  }
};
class MinCostFlow {
 public:
  struct edge {
    long long to, cap, cost, rev;
  };
  long long V;
  vector<edge> G[MIN_COST_FLOW_MAX_V];
  long long dist[MIN_COST_FLOW_MAX_V];
  long long prevv[MIN_COST_FLOW_MAX_V];
  long long preve[MIN_COST_FLOW_MAX_V];
  long long h[MIN_COST_FLOW_MAX_V];
  MinCostFlow(long long v) { V = v; }
  void init() {
    for (long long i = 0; i < MAX_FLOW_MAX_V; i++) {
      G[i].clear();
    }
  }
  void add_edge(long long from, long long to, long long cap, long long cost) {
    G[from].push_back((edge){to, cap, cost, (long long)G[to].size()});
    G[to].push_back((edge){from, 0, -cost, (long long)G[from].size() - 1});
  }
  void add_undirected_edge(long long e1, long long e2, long long cap,
                           long long cost) {
    add_edge(e1, e2, cap, cost);
    add_edge(e2, e1, cap, cost);
  }
  long long min_cost_flow(long long s, long long t, long long f) {
    long long res = 0;
    while (f > 0) {
      fill(dist, dist + V, INF);
      dist[s] = 0;
      bool update = true;
      while (update) {
        update = false;
        for (long long v = 0; v < V; v++) {
          if (dist[v] == INF) continue;
          for (long long i = 0; i < (long long)G[v].size(); i++) {
            edge &e = G[v][i];
            if (e.cap > 0 && dist[e.to] > dist[v] + e.cost) {
              dist[e.to] = dist[v] + e.cost;
              prevv[e.to] = v;
              preve[e.to] = i;
              update = true;
            }
          }
        }
      }
      if (dist[t] == INF) {
        return -1;
      }
      long long d = f;
      for (long long v = t; v != s; v = prevv[v]) {
        d = min(d, G[prevv[v]][preve[v]].cap);
      }
      f -= d;
      res += d * dist[t];
      for (long long v = t; v != s; v = prevv[v]) {
        edge &e = G[prevv[v]][preve[v]];
        e.cap -= d;
        G[v][e.rev].cap += d;
      }
    }
    return res;
  }
  long long min_cost_flow_dijkstra(long long s, long long t, long long f) {
    long long res = 0;
    fill(h, h + V, 0);
    while (f > 0) {
      priority_queue<pair<long long, long long>,
                     vector<pair<long long, long long> >,
                     greater<pair<long long, long long> > >
          que;
      fill(dist, dist + V, 0);
      dist[s] = 0;
      que.push(pair<long long, long long>(0, s));
      while (!que.empty()) {
        pair<long long, long long> p = que.top();
        que.pop();
        int v = p.second;
        if (dist[v] < p.first) continue;
        for (int i = 0; i < G[v].size(); i++) {
          edge &e = G[v][i];
          if (e.cap > 0 && dist[e.to] > dist[v] + e.cost + h[v] - h[e.to]) {
            dist[e.to] = dist[v] + e.cost + h[v] - h[e.to];
            prevv[e.to] = v;
            preve[e.to] = i;
            que.push(pair<long long, long long>(dist[e.to], e.to));
          }
        }
      }
      if (dist[t] == INF) {
        return -1;
      }
      for (int v = 0; v < V; v++) h[v] += dist[v];
      int d = f;
      for (int v = t; v != s; v = prevv[v]) {
        d = tmin<long long>(d, G[prevv[v]][preve[v]].cap);
      }
      f -= d;
      res += d * h[t];
      for (int v = t; v != s; v = prevv[v]) {
        edge &e = G[prevv[v]][preve[v]];
        e.cap -= d;
        G[v][e.rev].cap += d;
      }
      return res;
    }
    return 0;
  }
};
long long n, a[100000], num[3];
int main() {
  scanf("%lld", &n);
  for (long long i = 0; i < n; i++) scanf("%lld", &a[i]);
  for (long long i = 0; i < n; i++)
    if (a[i] % 4 == 0)
      num[0]++;
    else if (a[i] % 2 == 0)
      num[1]++;
    else
      num[2]++;
  if (num[1] == 0 && num[0] * 2 >= num[2])
    printf("Yes\n");
  else if (num[0] * 2 - 1 >= num[2])
    printf("Yes\n");
  else
    printf("No\n");
}
