Const
 N=40; { for example; change if you want to }
Var
 A:Array [1..N] of Integer;
 b:Boolean;
 D,Sum:Integer;
 i,j,I_min_even,I1_odd,I2_odd:Byte;
Begin
 Randomize;
 Writeln('Initial array:');
 I_min_even:=1;
 For i:=1 to N do
  begin
   A[i]:=-9+Random(109);
   Write(A[i]:4);
   If ((A[i] mod 2)=0) and (A[i]<A[I_min_even]) then I_min_even:=i;
  end;
 Writeln;
 Writeln;
 Writeln('Minimal even element is A[',I_min_even,']= ',A[I_min_even]);
 Writeln;
 b:=false;
 i:=0;
 Repeat
  Inc(i);
  If (A[i]>0) and (A[i]<A[I_min_even]) then b:=true;
 Until b or (i=N);
 If Not(b) then
  Writeln('No positive elements less then ',A[I_min_even])
 else
  Writeln('Yes, A[',i:2,']= ',A[i],' is less then ',A[I_min_even]);
 Writeln;
 Sum:=0;
 I2_odd:=N+1;
 Repeat
  Dec(I2_odd);
 Until (A[I2_odd] mod 2)<>0;
 I1_odd:=I2_odd;
 Repeat
  Dec(I1_odd);
 Until (A[I1_odd] mod 2)<>0;
 For i:=I1_odd+1 to I2_odd-1 do Inc(Sum,A[i]);
 Writeln('The sum of elements between A[',I1_odd:2,'] and A[',I2_odd:2,'] is ',Sum);
 Writeln;
 Writeln('Ordered array:');
 For i:=1 to (N div 2)-1 do
  For j:=1 to (N div 2)-i do
   If A[j]>A[j+1] then
    begin
     D:=A[j];
     A[j]:=A[j+1];
     A[j+1]:=D;
    end;
 For i:=(N div 2)+1 to N-1 do
  For j:=(N div 2)+1 to N+(N div 2)-i do
   If A[j]<A[j+1] then
    begin
     D:=A[j];
     A[j]:=A[j+1];
     A[j+1]:=D;
    end;
 For i:=1 to N do Write(A[i]:4);
 Readln
End.