import java.util.List;

public class 类斐波那契循环数 {
	static 	int maxx = Integer.MIN_VALUE;
	static int n = 197;
	static int [] arr;
	public static void main(String[] args) {

		List<Integer> list = new  ArrayList<>();
		for (int i = 7913837; i > 0  ; i--) {
			System.out.println(i);
			if(check_(i)) {
				System.out.println(i);
				break;
			}
		}

		
	}
	private static boolean check_(int i) {
		String string = String.valueOf(i);
		  arr = new int[(int)1e6];
		char[] charArray = string.toCharArray();
		for (int j = 0; j < charArray.length; j++) {
			arr[j+1]=charArray[j]-'0';
//			System.out.println(arr[j+1]);
		}
		for (int k = charArray.length+1; arr[k-1]<i; k++) {
			arr[k]=summer(k,charArray.length);
//			System.out.println(arr[k]);
			if(arr[k]==i) {
			return true;}
		}
		
		// TODO Auto-generated method stub
		return false;
	}
	private static int summer(int k,int n) {
		// TODO Auto-generated method stub
		int sum = 0;
		for (int i = k-n; i <= k-1; i++) {
//			System.out.println(arr[i]);
			sum+=arr[i];
		}
		return sum;
	}
}