//Знаю, что это решение далеко от понятия "изящество" //Pascal ABC.NET v3.0 сборка 1111 var max1,max2,max3,i,maxi1,maxi2:integer; ar:array of integer; begin max1:=-2147483648; max2:=-2147483648; max3:=-2147483648; setlength(ar,1); readln(ar[0]); i:=0; repeat inc(i); setlength(ar,i+1); readln(ar[i]); until ar[i]=0; for i:=0 to i do if ar[i]>max1 then begin; max1:=ar[i]; maxi1:=i; end; for i:=0 to i do if (ar[i]>max2) and (i<>maxi1) then begin; max2:=ar[i]; maxi2:=i; end; for i:=0 to i do if (ar[i]>max3) and (i<>maxi1) and (i<>maxi2) then max3:=ar[i]; write('Max1=',max1,' Max2=',max2,' Max3=', max3); end.
class ArrayNegative{
public static void main(String args[]){
java.util.Scanner in = new java.util.Scanner(System.in); long eArray[] = new long[1];
while((eArray[eArray.length-1] = in.nextLong())!=-1010){
long nArray[] = new long[eArray.length+1];
for(int nCell = 0; nCell<eArray.length; nCell++)nArray[nCell]=eArray[nCell];
eArray = nArray;
} eArrayCell:
for(int cCell = 0; cCell<eArray.length-1; cCell++){
if(eArray[cCell]>0)continue;
else for(int eCell = cCell+1; eCell<eArray.length-1; eCell++)
if(eArray[eCell]>0){
eArray[eArray.length-1]=eArray[cCell];
eArray[cCell]=eArray[eCell];
eArray[eCell]=eArray[eArray.length-1];
continue eArrayCell;
}
break;
}
for(int cCell = 0; cCell<eArray.length-1; cCell++)System.out.print(eArray[cCell]+" ");
}
}