(*PROGRAM INF11*);                                
                                                  
 CONST MX=99;                                     
 VAR A:ARRAY[1..MX] OF INTEGER;                   
     I,N,NH:1..MX;                                
     X,MAX,MIN:INTEGER;                           
                                                  
BEGIN                                             
 READLN(N);                                       
 WRITELN("N=",N);                                 
 FOR I:=1 TO N DO                                 
  BEGIN READLN(A[I]);WRITE(A[I]) END;             
 WRITELN;                                         
                                                  
 NH:=(N+1)DIV 2;                                  
 FOR I:=1 TO N DIV 2 DO                           
  IF A[I]<A[I+NH] THEN                            
    BEGIN                                         
     X:=A[I];A[I]:=A[I+NH];A[I+NH]:=X             
    END;                                          
 (*1..NH ENTHAELT MAX*)                           
 (*NH..N ENTHAELT MIN*)                           
 (*LINEARE SUCHE:*)                               
 MAX:=A[1];                                       
 FOR I:=2 TO NH DO                                
  IF A[I]>MAX THEN MAX:=A[I];                     
 MIN:=A[NH];                                      
 FOR I:=NH+1 TO N DO                              
  IF A[I]<MIN THEN MIN:=A[I];                     
 (*INSGESAMT WENIGER ALS Ï3*NH/2Ð-2 VERGLEICHE*)  
                                                  
 WRITELN("MAXIMUM:",MAX);                         
 WRITELN("MINIMUM:",MIN);                         
 WRITELN("VERGLEICHE:",N DIV 2+2*(NH-1));         
END.