#include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000

int digitsum(int depth, int a) {
	int ret = 0;
	while (a > 0) {
		ret += a % 10;
		a /= 10;
	}
	if (depth == 0) {
		return ret;
	}
	else {
		return digitsum(depth - 1, ret);
	}
}

int digitsum2(string S) {
	int ret = 0;
	rep(i, S.length()) {
		ret += S[i] - '0';
	}
	return digitsum(10, ret);
}

bool check(string S) {
	rep(i, S.length()) {
		bool flag = false;
		rep(j, 5) {
			if (S[i] == '0' + (j * 2)) flag = true;
		}
		if (!flag) return false;
	}
	return true;
}

string test(string S) {
	rep(i, S.length()) {
		S[i] = (char)((S[i] - '0') / 2) + '0';
	}
	return S;
}

int main(void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);
	string S; cin >> S;
	rep(i, (int)S.length() - 1) {
		//cout << S[i] << " " << S[i + 1] << endl;
		if (S[i] != S[i + 1]) break;
		if (i + 1 == (int)S.length() - 1) {
			cout << S << endl;
			return 0;
		}
	}
	int ans = 1;
	while (check(S)) {
		S = test(S);
		ans *= 2;
	}
	int tmp = digitsum2(S);
	if (tmp % 3 == 0) ans *= tmp;
	cout << ans << endl;




    return 0;
}