#include <stdio.h>
#include <stdlib.h>

int pr_of_digits(int z)
{
   int resid = 0;
   int prDigit = 1;
   while (z > 0)
   {
      resid = z % 10;
      prDigit = prDigit * resid;
      z = z / 10;
   }
   return prDigit;
}

bool three_not_one(int x)
{
   int resid,three,one = 0;
   bool check = false;
   while (x > 0) {
      resid = x % 10;
      if(resid == 3) three = three + 1;
      if(resid == 1) one = one + 1;
      x = x / 10;
   }
   if((three > 0) && (one == 0)) check = true;
   return check;
}

    int main()
    {
        int n,i,j,k,null;
        int masElements[20000];
        scanf("%d", &n);
        for(i=0; i<n; i++)
            scanf("%d", &masElements);

        for(i=n+1; i<20000; i++)
            masElements[i] = 0;

        for(i=0; i<n; i++)
            if(pr_of_digits(masElements[i]) > 50)
                {
                    masElements[i] = 0;
                    null = masElements[i];
                    for(k=i; k<=n-1; k++) masElements[k] = masElements[k+1];
                    masElements[n] = null;
                }

        /* for(i=0; i<n; i++)
        {
            if(three_not_one(masElements[i]) == true)
                {
                    int save = masElements[i+1];
                    masElements[i+1] = 0;
                    for(int k=n; k>=i+2; k--) masElements[k+1] = masElements[k];
                    masElements[i+2] = save;
                    masElements[i+1] = masElements[i];
                }
            i++;
        } */
        for(i=0; i<n; i++)
            printf("%d", masElements[i]);
     return 0;
    }