package yukicoder;

import java.math.BigInteger;
import java.util.Scanner;

public class Q443 {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		String s = sc.next();
		char[] N = s.toCharArray();
		BigInteger ori = new BigInteger(s);
		if (N.length == 1) {
			System.out.println(N);
			return;
		}

		int[] count = new int[10];
		for (int i = 0; i < N.length; ++i) {
			++count[N[i] - '0'];
		}
		int gcd = 0;
		for (int i = 0; i < 10; ++i) {
			for (int j = 0; j < 10; ++j) {
				--count[i];
				--count[j];
				if (count[i] >= 0 && count[j] >= 0) {
					gcd = gcd(9 * (i - j), gcd);
				}
				++count[i];
				++count[j];
			}
		}
		
		System.out.println(ori.gcd(BigInteger.valueOf(gcd)));

	}

	static int gcd(int a, int b) {
		while (a > 0) {
			b %= a;
			int d = b;
			b = a;
			a = d;
		}
		return b;
	}
}