#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
using namespace std;
typedef long long ll;

ll gcd(ll a, ll b) {
	if (b == 0)return a;
	else return gcd(b, a%b);
}

int main()
{
	string input;
	cin >> input;
	ll res = stoll(input);
	//vector<int> v;
	sort(input.begin(), input.end());
	//for (int i = 0; i < input.size(); i++)v.push_back(input[i]-'0');
	do {
		ll a = stoll(input);
		res = gcd(res, a);
	} while (next_permutation(input.begin(), input.end()));
	cout << res << endl;
}