program SkipList;

type
  NodePtr = ^Node;
  Node = record
    value: Integer;
    next: array of NodePtr;
  end;

procedure AddElement(var head: NodePtr; val: Integer);
var
  newNode, current: NodePtr;
  level, i: Integer;
begin
  New(newNode);
  newNode^.value := val;
  
  level := Random(2); // Генерируем случайный уровень пропусков
  
  SetLength(newNode^.next, level + 1);
  
  current := head;
  
  for i := High(current^.next) downto 0 do
  begin
    while (current^.next[i] <> nil) and (current^.next[i]^.value < val) do
    begin
      current := current^.next[i];
    end;
    
    if i <= level then
    begin
      newNode^.next[i] := current^.next[i];
      current^.next[i] := newNode;
    end;
  end;
end;

procedure PrintList(head: NodePtr);
var
  current: NodePtr;
  i: Integer;
begin
  current := head;
  
  while current^.next[0] <> nil do
  begin
    Write(current^.next[0]^.value, ' ');
    current := current^.next[0];
  end;
end;

var
  head: NodePtr;
  i: Integer;
begin
  New(head);
  head^.value := -1;
  SetLength(head^.next, 1);
  
  for i := 0 to 10 do
  begin
    AddElement(head, Random(100));
  end;
  
  PrintList(head);
end.