#include <map>

#include <set>

#include <list>

#include <cmath>

#include <ctime>

#include <deque>

#include <stack>

#include <queue>

#include <cctype>

#include <cstdio>

#include <string>

#include <vector>

#include <climits>

#include <cstdlib>

#include <cstring>

#include <iostream>

#include <algorithm>

#define LL long long

#define PI 3.1415926535897932626

using namespace std;

int gcd(int a, int b) {return a % b ==  ? b : gcd(b, a % b);}

int mason[] = {,,,,,,,};

int cnt[] = {,,,,,,,};

bool dp[<<];

int K,src[];

int trans(int x)

{

    int ans = ;

    for (int i = ; i < ; i++)

    {

        if (x % mason[i] == )

        {

            x /= mason[i];

            if (x % mason[i] == ) return ;

            ans |= (<<i);

        }

    }

    if (x != ) return ;

    return ans;

}

int calcu(int sta)

{

    int ans = ;

    for (int i = ; i < ; i++)

        if (sta & (<<i))

            ans += cnt[i];

    return ans;

}

int main()

{

    while (scanf("%d",&K)!=EOF)

    {

        //if (K == 0) break;

        int cnt = ;

        for (int i = ; i < K; i++)

        {

            scanf("%d",&src[i]);

            src[i] = trans(src[i]);

            if (src[i] == ) cnt++;

        }

        if (cnt == K) { puts("NO"); continue; }

        memset(dp,false,sizeof(dp));

        dp[] = true;

        for (int i = ; i < K; i++)

            for (int j = ; j < (<<); j++)

            {

                if (!(src[i] & j))

                    if (dp[j]) dp[j|src[i]] = true;

            }

        int ans = ;

        for (int i = ; i < (<<); i++)

            if (dp[i])

            ans = max(ans,calcu(i));

        printf("%d\n",ans);

    }

    return ;

}