The sequence of n - 1 consecutive composite numbers (positive integers that are not prime and not equal to 1) lying between two successive prime numbers p and p + n is called a prime gap of length n. For example, (24, 25, 26, 27, 28) between 23 and 29 is a prime gap of length 6.

Your mission is to write a program to calculate, for a given positive integer k, the length of the prime gap that contains k. For convenience, the length is considered 0 in case no prime gap contains k.



Input

The input is a sequence of lines each of which contains a single positive integer. Each positive integer is greater than 1 and less than or equal to the 100000th prime number, which is 1299709. The end of the input is indicated by a line containing a single zero.

Output

The output should be composed of lines each of which contains a single non-negative integer. It is the length of the prime gap that contains the corresponding positive integer in the input if it is a composite number, or 0 otherwise. No other characters should occur in the output.

Example

Input

10
11
27
2
492170
0


Output

4
0
6
0
114
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;


public class Main {

	/**
	 * @param args
	 * @throws IOException 
	 * @throws NumberFormatException 
	 */
	public static void main(String[] args) throws NumberFormatException, IOException {
		// TODO Auto-generated method stub
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
	
		PrimeNumberGenerator pg = new PrimeNumberGenerator();
		while(true){
			int n = Integer.parseInt(br.readLine());
			
			if(n == 0){
				break;
			}
			
			if(pg.isPrime(n)){
				System.out.println(0);
				continue;
			}
			
			int begin = -1;
			int end = -1;
			for(int i = n - 1; i >= 0; i--){
				if(pg.isPrime(i)){
					begin = i;
					break;
				}
			}
			
			for(int i = n + 1; i < 2000000 ; i++){
				if(pg.isPrime(i)){
					end = i;
					break;
				}
			}
			
			System.out.println(end - begin);
		}
	}

}

class PrimeNumberGenerator {
    private final int N = 2000000;
    private boolean[] isPrime= new boolean[N + 1];
 
    public PrimeNumberGenerator() {
        Arrays.fill(isPrime, true);
 
        isPrime[0] = false;
        isPrime[1] = false;
 
        int limit = (int)Math.sqrt(N);
        for(int i = 2; i <= limit ; i++){
 
            if(isPrime[i] == false){
                continue;
            }
 
            for(int j = i * 2; j <= N; j += i){
                isPrime[j] = false;
            }
        }
    }
 
    public boolean isPrime(int index){
        return isPrime[index];
    }
}