import std.algorithm, std.container, std.conv, std.math, std.range, std.typecons, std.stdio, std.string;

auto rdsp(){return readln.splitter;}
void pick(R,T)(ref R r,ref T t){t=r.front.to!T;r.popFront;}
void readV(T...)(ref T t){auto r=rdsp;foreach(ref v;t)pick(r,v);}
void readA(T)(size_t n,ref T[]t){t=new T[](n);auto r=rdsp;foreach(ref v;t)pick(r,v);}

void main()
{
  int n; readV(n);
  int[] a; readA(n, a);

  auto n1 = 0, n2 = 0, n3 = 0;
  foreach (ai; a) {
    if (ai%4 == 0)      ++n1;
    else if (ai%2 == 0) ++n2;
    else                ++n3;
  }

  writeln(n2 == 0 && n3 <= n1+1 || n2 > 0 && n3 <= n1 ? "Yes" : "No");
}
