<Problem>
http://ntucoder.net/Problem/Details/1140
Uses Crt;
Var n,i,j,vitri,k,min:longint;
a:array[1..1000000] of longint;
Begin
readln(n);
for i:=1 to n do read(a[i]); //Nhap n phan tu
for i:=1 to n-1 do //Chon a[n] lam chot, xet n-1 so
begin
vitri:=i; //vitri ban dau la i
min:=a[i]; //macdinh a[i] la so nho nhat ban dau
for j:=i+1 to n do
begin
if a[j]<min then begin //tim so be hon
vitri:=j; //luu vitri
min:=a[j]; //luu min
end;
end; //writeln(j);
if i<>vitri then //hoan vi dang cap :))
begin
a[i]:=a[i] xor a[vitri];
a[vitri]:=a[i] xor a[vitri];
a[i]:=a[i] xor a[vitri];
end;
for k:=1 to n do //in ra
if (k=i) or (k=vitri) then write('[',a[k],'] ')
else write(a[k],' '); //Co hai truong hop: truong hop so a[i] la min, hoac a[k] la min (k>i)
writeln; // xuong dong :l
end;
readln;
End.