uses crt;
type mang=array[1..100000]of longint;
var n,i,dem,m:longint; a:mang;
procedure sx(n:longint; var a:mang);
var tam,i,j:longint;
        begin
         for i:=1 to n-1 do
          for j:=i+1 to n do
           if(a[i]>a[j])then
                begin
                 tam:=a[i];
                 a[i]:=a[j];
                 a[j]:=tam;
                end;
         for i:=1 to n do write(a[i],' ');
        end;
begin
 clrscr;
  write('n=');readln(n);
  dem:=0;
  for i:=1 to n do begin write('a[',i,']=');readln(a[i]); if(a[i] mod 2=0)and(a[i]mod 3=0)then inc(dem);end;
  write('nhap so can thay the:');readln(m);
  sx(n,a);
  writeln;
  writeln(dem);
  for i:=1 to n do if(i<>1)then
        begin
         if(a[i-1]<=m)and(a[i+1]>=m)then begin a[i]:=m; break; end;
        end else if(a[i+1]>=m)then begin a[i]:=m; break; end;
  sx(n,a);
 readln;
end.

uses crt;
var a : array [1 .. 1000000] of integer;
    i, n, k, j, v : integer;
begin
clrscr;

readln(n);
for i := 1 to n do read(a[i]);
readln(k);

for i := 1 to n do
    if (a[i] mod 2 = 0) and (a[i] mod 3 = 0) then v := v + 1;

for j := n downto 2 do
    for i := 1 to j - 1 do
        if a[i] < a[i + 1] then
            begin 
                a[i] := a[i] + a[i + 1];
                a[i + 1] := a[i] - a[i + 1];
                a[i] := a[i] - a[i + 1]; 
            end;

for i := n downto 1 do write(a[i],' ');
writeln; writeln(v);

for i := 1 to n do 
    if k < a[i] then v := i;
for i := n + 1 downto v + 1 do
    a[i] := a[i - 1];
a[v + 1] := k;

for i := n + 1 downto 1 do write(a[i],' ');
readln
end.