use std::env;
use std::io;
use std::io::prelude::*;

//===================================================
// MACROs need to be defined above the use place ... ?
macro_rules! dprintln {
    ($($x:expr),*) => {{
        if $crate::is_debug_mode() {
            let f = || {println!( $($x),*)};
            f()
        }
    }}
}

//===================================================

fn main() {
    // Initialize
    set_debug_mode(false);
    for arg in env::args() {
        if arg == "--debug" {
            set_debug_mode(true);
        }
    }
    dprintln!("[DebugMode] {}", "On");

    // Execute
    dprintln!("=================");
    dprintln!("= READ INPUT     ");
    let stdin = io::stdin();
    let input = Input::new(stdin.lock());
    dprintln!("[Input] \n{:?}", input);
    dprintln!("=================");
    dprintln!("= INTERPRET INPUT");
    let q = input.into_quiz();
    dprintln!("[Quiz] \n{:?}", q);
    dprintln!("=================");
    dprintln!("= SOLVE QUIZE    ");
    let a = q.solve();
    dprintln!("[Answer] \n{:?}", a);
    dprintln!("=================");
    dprintln!("= PRINT ANSWER   ");
    a.print();
    dprintln!("=================");
}

#[derive(Debug)]
struct Quiz {
    // ######### TODO: Implement HERE
    n: u32,      // 1 <= N <= 100
    v: Vec<u32>, // 1 <= v[i] <= 100, length=N
}

#[derive(Debug)]
struct Answer {
    // ######### TODO: Implement HERE
    vv: Vec<Vec<u32>>,
    // vv[i] are progress of sorting.
    // i = Q.n [*]Insert sort perfomes the same number steps as the number of target's elements.
}

impl Input {
    fn into_quiz(mut self) -> Quiz {
        // ######### TODO: Implement HERE
        let n: u32 = self.parse_next().unwrap();
        let v: Vec<u32> = self.parse_next_vec(n as usize).unwrap();
        Quiz { n, v }
    }
}

impl Quiz {
    fn solve(self) -> Answer {
        // ######### TODO: Implement HERE
        let vv = Vec::new();
        let mut ans = Answer { vv };

        let mut v = self.v.to_vec();
        let length = self.n as usize;

        ans.vv.push(v.to_vec());

        for i in 1usize..length {
            let key = v[i].clone();
            dprintln!("i {}, v[{}] = {}", i, i, key);
            let mut j: i32 = i as i32 - 1;
            while j >= 0 && v[j as usize] > key {
                dprintln!(" v[{}] > key", j);
                let jj = j as usize;
                v[jj + 1] = v[jj];
                j = j - 1;
            }
            dprintln!(" v[{}] <- {}", j + 1, key);
            v[(j + 1) as usize] = key;

            ans.vv.push(v.to_vec());
        }

        dprintln!(" ans: {:?}", ans);

        ans
    }
}

impl Answer {
    fn print(self) {
        // ######### TODO: Implement HERE
        for v in self.vv {
            println!("{}", concat_vec_to_string(&v));
        }
    }
}

// =====================================================
// =
// =====================================================

//==================================================
// Stdin Reader
#[derive(Debug)]
pub enum Token {
    Word(String),
    LineBreak,
}

impl Token {
    pub fn is_word(&self) -> bool {
        match *self {
            Token::Word(ref _x) => true,
            _ => false,
        }
    }
}

#[derive(Debug)]
pub struct Input {
    tokens: Vec<Token>,
}

impl Input {
    pub fn new<T: BufRead>(input: T) -> Self {
        let lines = input.lines();
        let words = lines.flat_map(|l| tokenaize(l.unwrap()));
        let mut words = words.collect::<Vec<_>>();

        words.reverse();

        Input { tokens: words }
    }

    pub fn read_next_word(&mut self) -> Option<Token> {
        loop {
            match self.tokens.pop() {
                Some(Token::LineBreak) => (),
                x => return x,
            }
        }
    }

    pub fn parse_next<T>(&mut self) -> Option<T>
    where
        T: std::str::FromStr,
    {
        if let Some(Token::Word(str)) = self.read_next_word() {
            match str.parse() {
                Ok(x) => Some(x),
                _ => None,
            }
        } else {
            None
        }
    }

    pub fn parse_next_vec<T>(&mut self, size: usize) -> Option<Vec<T>>
    where
        T: std::str::FromStr,
    {
        let mut v = Vec::new();

        for _i in 0..size {
            if let Some(t) = self.parse_next() {
                v.push(t);
            } else {
                return None;
            }
        }

        Some(v)
    }

    pub fn parse_next_vec2<T>(&mut self, size2: usize, size1: usize) -> Option<Vec<Vec<T>>>
    where
        T: std::str::FromStr,
    {
        let mut v = Vec::new();

        for _i in 0..size2 {
            if let Some(t) = self.parse_next_vec(size1) {
                v.push(t);
            } else {
                return None;
            }
        }

        Some(v)
    }
}

fn tokenaize(str: String) -> Vec<Token> {
    let mut v = Vec::new();

    for w in str.split_whitespace() {
        v.push(Token::Word(w.to_string()));
    }
    v.push(Token::LineBreak);
    v
}

//==================================================
// Utility Functions
fn concat_vec_to_string<T>(v: &Vec<T>) -> String
where
    T: std::fmt::Display,
{
    let mut string = String::new();

    if let Some((h, t)) = v.split_first() {
        string = h.to_string();

        for obj in t {
            string = format!("{} {}", string, obj);
        }
    }

    return string;
}

//==================================================
// Debug Switch
static mut S_DEBUG_MODE: bool = false;
fn is_debug_mode() -> bool {
    unsafe { S_DEBUG_MODE }
}

fn set_debug_mode(mode: bool) {
    unsafe {
        S_DEBUG_MODE = mode;
    }
}



Measured memory_bytes: 5064