program CocktailSort;

var
    Size, i: integer;
    Mas: array of integer;

procedure ShakerSort(Mas: array of integer; Size: integer);
var
    Left, Right, temp, i: integer;
begin
    Left := 1;
    Right := Size;
    while Left <= Right do
    begin
        for i := Right downto Left do
            if (Mas[i - 1] > Mas[i]) then
            begin
                Temp := Mas[i];
                Mas[i] := Mas[i - 1];
                Mas[i - 1] := temp;
            end;
        Left := Left + 1;
        for i := Left to Right do
            if Mas[i - 1] > Mas[i] then
            begin
                temp := Mas[i];
                Mas[i] := Mas[i - 1];
                Mas[i - 1] := temp;
            end;
        Right := Right - 1;
    end;
    for i := 0 to Size-1 do
        writeln(Mas[i]);
end;

begin
    writeln('Размер массива:');
    readln(Size);
    SetLength(Mas, Size);
    for i := 0 to Size-1 do
    begin
        writeln(i, '-ый элемент:');
        readln(Mas[i]);
    end;
    writeln('После сортировки:');
    ShakerSort(Mas, Size);
    Readln
end.