#include //#define int long long using namespace std; inline int read() { int x=0,f=1;char ch=getchar(); while (ch<'0'||ch>'9'){if (ch=='-') f=-1;ch=getchar();} while (ch>='0'&&ch<='9'){x=(x<<3)+(x<<1)+ch-48;ch=getchar();} return x*f; } void write(int x) { if(x<0)putchar('-'),x=-x; if(x<10)putchar(x+'0'); else write(x/10),putchar(x%10+'0'); } const int N=5e5; const int mod=1e9+7; long long n; int top; int sum[N]; int ans; bool fl[N]; void dfs(int u,int sm){ if(u==top+1){ if(!ans)ans=sm; else ans=__gcd(ans,sm); return; } for(int i=1;i<=top;i++){ if(fl[i])continue; fl[i]=1; dfs(u+1,sm*10+sum[i]); fl[i]=0; } } signed main(){ // freopen("gcd.in","r",stdin); // freopen("gcd.out","w",stdout); cin>>n; while(n){ sum[++top]=n%10; n/=10; } dfs(1,0); cout<