help ạ , ngôn ngữ pascal

var n,i,j,temp: integer;
    check: boolean;
    a: array[1..100005] of integer;
begin
    readln(n);
    for i:=1 to n do read(a[i]);
    for i:=1 to n-1 do for j:=i+1 to n do if a[i]<a[j] then begin
        temp:=a[i];
        a[i]:=a[j];
        a[j]:=temp;
    end;
    check:=true;
    for i:=2 to n do if a[i]<>a[1] then begin
        write(a[i]);
        check:=false;
        break;
    end;
    if check then write('No solution.');
end.

$\color{#4c886b}{\texttt{/* }}\color{#e65052}{\texttt{Th}}\color{#bb4544}{\texttt{ai}}\color{#645c9d}{\texttt{Hu}}\color{#424065}{\texttt{yy}}\color{#4c886b}{\texttt{ */}}$

$\color{#9e9458}{\texttt{/* }}\color{#e65052}{\texttt{Th}}\color{#bb4544}{\texttt{ai}}\color{#645c9d}{\texttt{Hu}}\color{#424065}{\texttt{yy}}\color{#9e9458}{\texttt{ */}}$

uses crt;
var s,i,n:longint;
a:array[1..1000000] of longint;

procedure sort(l,r:longint);
var  i,j,x,t:longint;
begin
i:=l;
j:=r;
x:=a[(l+r) div 2];
repeat
 while a[i]>x do
  i:=i+1;
 while a[j]<x do
  j:=j-1;
 if i<=j then
 begin
  t:=a[i];
  a[i]:=a[j];
  a[j]:=t;
  i:=i+1;
  j:=j-1;
 end;
until i>j;
if j>l then
sort(l,j);
if i<r then
sort(i,r);
end;

begin
clrscr;
readln(n);
for i:=1 to n do
 readln(a[i]);
sort(1,n);
for i:=1 to n do
 write(a[i],' ');
writeln;
if ((a[2]=a[n])and(n>2)) or(n=1) then write('NO solution')
else
 if(n=2) and(a[1]=a[2]) then write('No so lution')
 else
  write(a[2]);
readln
end.