program Project1;


uses
  SysUtils;

var
    T:array[0..4] of integer;
    i:integer;
procedure babelkowe(var tab:array of integer);
var i,j,n,k,temp:integer;
begin
     n := length(tab);
     k := n;
     for i:=0 to n-2 do
         begin
              for j := 0 to k-2 do
                  if (tab[j]>tab[j+1])
                  then
                      begin
                           temp:=tab[j];
                           tab[j]:=tab[j+1];
                           tab[j+1]:=temp;
                      end;
              k := k-1;
         end;
end;

procedure insertsort(var tab:array of integer);
var i,j,n,temp:integer;
begin
    n := length(tab);
    for i:=1 to n-1 do
        begin
        j := i;
        temp := tab[j];
        while (temp < tab[j-1]) and (j>0) do
            begin
            tab[j] := tab[j-1];
            dec(j);
                    end;
        tab[j] := temp;
        end
end;

procedure selectionsort(var tab:array of integer);
var i,j,n,temp,index,k:integer;
begin
    n := length(tab);
    k := n-1;
    for i:=0 to n-2 do
        begin
        index := 0;
        for j:=1 to k do
            if (tab[j] >= tab[index])
        then index := j;
        temp := tab[k];
        tab[k] := tab[index];
            tab[index] := temp;
        dec(k);
        end;
end;

procedure quicksort(var tab:array of integer; l:integer; r:integer);
var i,j,med,q,temp:integer;
begin

    if (l < r) then
        begin
            i := l-1;
            j := r+1;
            med := tab[l];
            while (i < j) do
                begin
                    repeat
                        inc(i);
                    until(med <= tab[i]);
                    repeat
                        dec(j);
                    until(med >= tab[j]);
                    if(i <= j) then
                        begin
                            temp := tab[i];
                            tab[i] := tab[j];
                            tab[j] := temp;
                        end;
                end;
            if(i < j) then
                begin
                        temp := tab[i];
                        tab[i] := tab[j];
                        tab[j] := temp;
                end;
            q := j;
            quicksort(tab, l, q);
            quicksort(tab, j+1, r);
        end;
end;
begin
     for i:=0 to 4 do
         readln(T[i]);
     for i:=0 to 4 do
         write(T[i]:4);

     quicksort(T, 0, 4);
     writeln;

     for i:=0 to 4 do
         write(T[i]:4);

     readln;
end.