import core.bitop;
import std.algorithm;
import std.ascii;
import std.bigint;
import std.conv;
import std.functional;
import std.format;
import std.math;
import std.numeric;
import std.range;
import std.stdio;
import std.string;
import std.random;
import std.typecons;

alias sread = () => readln.chomp();
alias Point2 = Tuple!(long, "y", long, "x");

T lread(T = long)()
{
    return readln.chomp.to!T();
}

T[] aryread(T = long)()
{
    return readln.split.to!(T[])();
}

void scan(TList...)(ref TList Args)
{
    auto line = readln.split();
    foreach (i, T; TList)
    {
        T val = line[i].to!(T);
        Args[i] = val;
    }
}

void minAssign(T, U = T)(ref T dst, U src)
{
    dst = cast(T) min(dst, src);
}

void maxAssign(T, U = T)(ref T dst, U src)
{
    dst = cast(T) max(dst, src);
}

enum MOD = (10 ^^ 9) + 7;

void main()
{
    long N = lread();
    auto A = aryread();
    foreach (i; 0 .. N)
    {
        long cnt;
        while (~A[i] & 1)
        {
            A[i] >>= 1;
            cnt++;
        }
        A[i] = cnt;
    }
    A.sort();
    // writeln(A);
    long prev = A.front;
    A.popFront();
    foreach (i; 1 .. N)
    {
        if (i & 1)
        {
            long b = A.back;
            A.popBack();
            if (prev + b < 2)
            {
                writeln("No");
                return;
            }
            prev = b;
        }
        else
        {
            long f = A.front;
            A.popFront();
            if (prev + f < 2)
            {
                writeln("No");
                return;
            }
            prev = f;
        }
    }
    writeln("Yes");
}
