// https://atcoder.jp/contests/agc008/tasks/agc008_d
//
#![allow(unused_imports)]
use std::io::*;
use std::io::Write;
use std::fmt::*;
use std::str::*;
use std::cmp::*;
use std::collections::*;

// Input macros.
// Original by tanakh: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
#[allow(unused_macros)]
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};

    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };

    ($iter:expr, mut $var:ident : $t:tt $($r:tt)*) => {
        let mut $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };

    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };

    ($iter:expr, [ next / $t:tt ]) => {
        {
            let len = read_value!($iter, usize);
            (0..len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
        }
    };

    ($iter:expr, switch) => {
        {
            let ty = read_value!($iter, i32);
            if ty == 1 {
                vec![ty, read_value!($iter, i32), read_value!($iter, i32)]
            } else if ty == 2 {
                vec![ty, read_value!($iter, i32)]
            } else {
                vec![ty, read_value!($iter, i32)]
            }
        }
    };

    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };

    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };

    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}

#[allow(unused_macros)]
macro_rules! read_line {
    ($t:tt) => {
        {
            let mut s = String::new();
            std::io::stdin().read_line(&mut s).unwrap();
            s.trim_right().parse::<$t>().unwrap()
        }
    }
}

#[allow(unused_macros)]
macro_rules! dvec {
    ($t:expr ; $len:expr) => {
        vec![$t; $len]
    };

    ($t:expr ; $len:expr, $($rest:expr),*) => {
        vec![dvec!($t; $($rest),*); $len]
    };
}

#[allow(unused_macros)]
macro_rules! ifv {
    ($t:expr, $a:expr, $b: expr) => {
        if $t { $a } else { $b }
    }
}

#[allow(unused_macros)]
macro_rules! fill {
    ($t:expr, $v:expr) => {
        for i in 0..$t.len() {
            $t[i] = $v;
        }
    };
}

#[allow(unused_macros)]
macro_rules! join {
    ($t:expr, $glue:expr) => {
        $t.into_iter().map(|w| w.to_string()).collect::<Vec<_>>().join($glue)
    };
}

#[allow(unused_macros)]
macro_rules! debug {
    ($($a:expr),*) => {
        println!(concat!($(stringify!($a), " = {:?}, "),*), $($a),*);
    }
}

// ===

fn solve(n: usize, x: Vec<usize>) -> Option<Vec<usize>> {
    let m = n*n;
    let mut a = vec![0; m];
    for i in 0..n {
        a[x[i]] = i+1;
    }
    let pa = a.clone();
    let mut free_bucket = VecDeque::new();
    for i in 0..n {
        for j in 0..i {
            free_bucket.push_back(i);
        }
    }

    let mut head = 0;
    for i in 0..m {
        if a[i] != 0 {
            let x = a[i];
            let mut need_to_prefill = x-1;
            while head < i && need_to_prefill >= 1 {
                if a[head] == 0 {
                    a[head] = x;
                    need_to_prefill -= 1;
                }
                head += 1;
            }
            if need_to_prefill != 0 {
                return None;
            }
        }
    }

    let mut postfill_queue = VecDeque::new();
    for i in 0..m {
        if pa[i] != 0 {
            for _ in pa[i]..n {
                postfill_queue.push_back(pa[i]);
            }
        } else if a[i] == 0 {
            if postfill_queue.len() >= 1 {
                a[i] = postfill_queue.pop_front().unwrap();
            } else {
                return None;
            }
        }
    }

    if postfill_queue.len() != 0 {
        return None;
    }
    for i in 0..m {
        if a[i] == 0 {
            return None;
        }
    }
    Some(a)
}

fn main() {
    input! {
        n: usize, x: [usize1; n]
    };
    if let Some(a) = solve(n, x) {
        println!("Yes");
        println!("{}", join!(a, " "));
    } else {
        println!("No");
    }
}


Measured memory_bytes: 15476