/*
Jia Tse
CS477 - Algorithm Analysis
Algorithm from COMPUTER ALGORITHMS C++ - Ellis Horowitz
02/24/06

INSERTION SORT
this reads m numbers from stdin and sort it 
using insertion sort
*/

#include <iostream>

using namespace std;

#define m 100  //number of numbers

void insertionSort(int a[], int n){
  //sort the array a[0:n] into nondecreasing order, n>=1 

	int item, i;
  for (int j=1; j<=n; j++){
		item = a[j];
    i = j-1;
    while ((i>=0) && (item <a[i])){
      a[i+1] = a[i];
      i--;
    }
    a[i+1] = item;
  }
}
    

void print(int a[], int n){
	/* prints values in a[] from 0 to n */
  for(int i=0; i<n; i++)
    cout<<a[i]<<endl;

}


void minFirst(int a[], int n){
  //this finds the minimum value and stores it as first element
  int min = a[0];
  int index = 0;

  for (int i=1; i<n; i++){
    if (a[i] < min) {
      min = a[i];
      index = i;
    }
  }
  a[index] = a[0];
  a[0] = min;
}

void read(int a[], int n){
	/* this reads n numbers from stdin and store
	 * it in a[];
	 */
	for (int i=0; i<n; i++)
		cin>>a[i];
}

int main(){
  int a[m];
	
	read(a,m);
  minFirst(a,m);
  insertionSort(a,m);
  print(a,m);

  return 0;
}