#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<map>
#include<queue>
#include<string>
#include<sstream>
#include<cmath>
#include<numeric>
using namespace std;

int main(){

  string n;
  cin >> n;

  int tmp = 0;
  int a = n[0]-'0';
  bool f = true;
  bool f2 = true;
  bool f3 = true;
  bool f4 = true;
  vector<int> cnt(10, 0);
  vector<int> cnt2(10, 0);
  for(int i=0; i<n.size(); i++){
    tmp += n[i]-'0';
    if( a != n[i]-'0' ) f = false;

    if( (n[i]-'0')%2 != 0 ) f2 = false;
    if( (n[i]-'0')%4 != 0 ) f3 = false;
    if( (n[i]-'0')%8 != 0 ) f4 = false;

    if( (n[i]-'0') != 0 ) cnt[ n[i]-'0' ] = 1;
    cnt2[ n[i]-'0' ]++;
  }

  if( f ){
    cout << n << endl;
    return 0;
  }
  int ans = 1;

  // if( accumulate( cnt.begin(), cnt.end(), 0 ) == 1 ){
  //   for(int i=0; i<10; i++) if( cnt[i] != 0 && (i != 2 && i != 3 && i != 4 && i != 6 && i != 9 ) ) ans *= i;
  // }

  if( tmp % 3 == 0 ) ans = 3;
  if( tmp % 9 == 0 ) ans = 9;

  if( accumulate( cnt.begin(), cnt.end(), 0 ) == 1 && cnt[5] == 1 ){
    ans *= 5;
  }

  if( f4 ){
    ans *= 8;
  }else if( f3 ){
    ans *= 4;
  }else if( f2 ){
    ans *= 2;
  }

  cout << ans << endl;

  return 0;
}




// EOF