void rec(int n){
      if (n<10){
         out.print(n);
      }else{
         boolean locFind = false;
         for (int i = 9; i>1; i--){
            if (n % i==0){
               locFind = true;
               rec(n/i);
               out.print(i);
               break;
            }
         }
         if (!locFind){
            out.print(-1);
            out.close();
         }
      }
   }

   void solve(){
      int n = in.nextInt();
      if (n==0){
         out.print(10);
      }else{
         rec(n);
      }
   }