use std::collections::HashSet;

fn gcd(a: usize, b: usize) -> usize {
    if b == 0 { return a; }
    gcd(b, a % b)
}

fn main() {
    let mut n = String::new();
    std::io::stdin().read_line(&mut n).ok();
    let n: usize = n.trim().parse().unwrap();
    let mut a = String::new();
    std::io::stdin().read_line(&mut a).ok();
    let mut a: Vec<usize> = a.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();

    a.sort();
    let mut zero_cnts = a.iter().filter(|&&v| v == 0).count() as isize;
    let a = a.into_iter().filter(|&v| v > 0).collect::<Vec<_>>();
    if a.len() < 2 {
        println!("Yes");
        return;
    }
    let aset = a.iter().copied().collect::<HashSet<_>>();
    if aset.len() == 1 {
        println!("Yes");
        return;
    }
    let start = a[0];
    let a = a.into_iter().map(|v| v - start).collect::<Vec<_>>();
    let base = (1..a.len()).fold(a[0], |x, i| gcd(x, a[i]));
    for i in 0..a.len()-1 {
        let diff = a[i+1] - a[i];
        if diff == 0 {
            println!("No");
            return;
        }
        zero_cnts -= (diff / base - 1) as isize;
    }
    if zero_cnts < 0 {
        println!("No");
    } else {
        println!("Yes");
    }
}