begin
   integer
     I;
   real
     R;
   boolean
     B;
   array
     A1[1 : I + B],
     A2[2 : 4, 5 : 7];
   switch S ≔      if R × P0 < 0 then L else L2;
   procedure P0;
      R ≔ I ÷ R;
   procedure P1(F);
      real
        F;
      B ≔ I + R;
   L :;
   B ≔ I > S;
   B ≔ B ∨ P0;
   R ≔ B + A1;
   L2 :;
   R ≔ B ∧ B;
   I ≔ P1(R);
   goto B;
   I;
   P1(A2 / R);
   R[I] ≔ 5;
   I ≔      if B then
     S
   else
     R;
   P1(if B then B else I - I);
   R ≔ B ≔ B ∧ B;
   for I ≔ B step 1 until R do
        A1[S] ≔ A2[2];
   A1 ≔ 0;
   if R then
     goto L;
   for P0 ≔ 1,
     2 do
        A2[B, I] ≔ 0;
   begin
      array
        Q[B : 1];
   end;
   P1(I, R);
   P1;
end