program deep (input, output);
const n = 10;
  neg = -5;
  pi = 3.14159;
  h = 'h';
type
  intarr = array [1..10] of integer;
  matrix = array [0..1, 0..2] of integer;
  point = record x, y: integer end;
var
  i, j: integer;
  ch: char;
  b: boolean;
  r: real;
  a: intarr;
  pt: point;
function sum(a, b: integer): integer;
begin
  sum := a + b
end;
function isodd(n: integer): boolean;
begin
  isodd := odd(n)
end;
procedure fill(var a: intarr; value: integer);
var k: integer;
begin
  for k := 1 to n do a[k] := value
end;
begin
  for i := 1 to n do a[i] := i;
  while i < n do i := i + 1;
  repeat
    case i of
      1: write(1);
      2, 3: write(2)
    end;
  until i > n;
  pt.x := sum(1, 2);
  r := 1.5e-3;
  b := (i = 1) and (j <> 2) or not b;
  fill(a, 0);
  writeln('done')
end.