extern crate core;

use std::fmt;
use std::cmp::{Ordering, min, max};
use std::fmt::{Display, Error, Formatter};
use std::f32::MAX;
use std::ops::{Add, Sub, Mul, Div, Neg, Index, IndexMut};
use std::collections::{BTreeMap, VecDeque, BinaryHeap};

fn show<T: Display>(vec: &Vec<T>) {
    if vec.is_empty() {
        println!("[]");
    }else {
        print!("[{}", vec[0]);
        for i in 1 .. vec.len() {
            print!(", {}", vec[i]);
        }
        println!("]");
    }
}
fn show2<T: Display>(vec: &Vec<Vec<T>>) {
    if vec.is_empty() {
        println!("[]");
    }else {
        for l in vec {
            show(l);
        }
    }
}
macro_rules! read_line{
    () => {{
        let mut line = String::new();
        std::io::stdin().read_line(&mut line).ok();
        line
    }};
    (delimiter: ' ') => {
        read_line!().split_whitespace().map(|x|x.to_string()).collect::<Vec<_>>()
    };
    (delimiter: $p:expr) => {
        read_line!().split($p).map(|x|x.to_string()).collect::<Vec<_>>()
    };
    (' ') => {
        read_line!(delimiter: ' ')
    };
    ($delimiter:expr) => {
        read_line!(delimiter: $delimiter)
    };
    (' '; $ty:ty) => {
        read_line!().split_whitespace().map(|x|x.parse::<$ty>().ok().unwrap()).collect::<Vec<$ty>>()
    };
    ($delimiter:expr; $ty:ty) => {
        read_line!($delimiter).into_iter().map(|x|x.parse::<$ty>().ok().unwrap()).collect::<Vec<$ty>>()
    };
}
macro_rules! read_value{
    () => {
        read_line!().trim().parse().ok().unwrap()
    }
}
macro_rules! let_all {
    ($($n:ident:$t:ty),*) => {
        let line = read_line!(delimiter: ' ');
        let mut iter = line.iter();
        $(let $n:$t = iter.next().unwrap().parse().ok().unwrap();)*
    };
}
macro_rules! let_mut_all {
    ($($n:ident:$t:ty),*) => {
        let line = read_line!(delimiter: ' ');
        let mut iter = line.iter();
        $(let mut $n:$t = iter.next().unwrap().parse().ok().unwrap();)*
    };
}

fn primes(upper_limit: usize) -> Vec<usize> {
    let mut is_prime = vec![true; upper_limit];
    let mut i = 4;
    while i < upper_limit {
        is_prime[i] = false;
        i += 2;
    }
    i = 3;
    while i * i < upper_limit {
        if is_prime[i] {
            let mut j = i * i;
            while j < upper_limit {
                is_prime[j] = false;
                j += i;
            }
        }
        i += 2;
    }
    let mut result = Vec::new();
    for i in 2 .. upper_limit {
        if is_prime[i] {
            result.push(i);
        }
    }
    result
}
fn lower_bound(vec: &Vec<usize>, target: usize) -> usize {
    let mut left = 0;
    let mut right = vec.len();
    while left < right {
        let mid = (left + right) / 2;
        if vec[mid] < target {
            left = mid + 1;
        }else {
            right = mid;
        }
    }
    right
}
fn upper_bound(vec: &Vec<usize>, target: usize) -> usize {
    let mut left = 0;
    let mut right = vec.len();
    while left < right {
        let mid = (left + right) / 2;
        if vec[mid] <= target {
            left = mid + 1;
        }else {
            right = mid;
        }
    }
    right
}
fn main() {
    let prime = primes(1299709 + 1);
    loop {
        let_all!(n: usize);
        if n == 0 {
            return
        }
        println!("{}", prime[lower_bound(&prime, n)] - prime[upper_bound(&prime, n) - 1]);
    }
}


Measured memory_bytes: 6976