begin;
    comment  'LIBRARY' 1
    ;
    Boolean B;
    real X;
    integer array A[+1 : .6102];
    integer I, N;
    B := false;
    N := 10+2 TIMES .6;
    X := 0;
    comment    
    ;
    begin;
        comment    
        ;
        own real  array C0[0 : 1];
        procedure P(A, B, C); 
          value A;
          integer A;
          string B;
          Boolean array C;
        begin;
            begin;
                C[(1)] := true OR .8 > C0[if true then 0 else 1];
                C[-(-2)] := false IMPL .4 NOTLESS X + 50010-2;
                C[.3101] := .3 NOTEQUAL (0) IMPL (if 101 NOTEQUAL 104 then true else false);
                if false then P(A, <STRING>, C) else ;
            end ;
            ;
            for I := 1 step 1 until 3 do
              begin;
                if .3 NOTLESS 6 ÷ 2 then goto OUT;
                OUT: ;
            end ;
        end ;
        real procedure A0L;
        A0L := if X < X then 104 else .6;
        integer procedure II;
        II := +1 TIMES (3 ÷ (4)) - 102 + A0L;
        begin;
            Boolean array C[II + II ÷ II ÷ II : 1 POWER II + 3];
            C0[0] := if B IMPL (1) = (2) then 0 else 0;
            P(+1, <>, C);
            I := -N - I TIMES N ÷ N POWER 1;
            goto if 1 - .9 = II ÷ 6 IMPL II NOTLESS A0L then L else L1;
            L: L1: for I := I step N until II do ;
            if +.3 + 102 = +(.3) then B := ¬B EQUIV false else B := 101 > 3 EQUIV true;
            for I := ((1)) step +(1) until +60 do
              begin;
                A[101 - 9] := 1 ÷ .1 - 0.1;
                A[I] := if (true) OR A[1] - 1 NOTEQUAL A[101 - 9] TIMES 1 IMPL false then +1 else -1;
            end ;
            for I := 1,
                  -9 + A[1] step -9 + A[1] until .6101 do
              N := if +A[1] + 0 = A[1] then 0 else 101 - 9 + N;
            if +N NOTEQUAL +1 EQUIV N = -N OR 0 < +N IMPL 0 + N NOTLESS 0 then  else goto L2;
            B := B IMPL N > +0 EQUIV 0 < -A[1] ÷ 101 OR true;
            L2: goto (L3);
            L3: B := true IMPL false OR false IMPL true EQUIV +0 NOTEQUAL -1;
            N := 1 POWER N TIMES 1 + (101) TIMES 10-2 POWER (1) ÷ (2) + N;
            B := true EQUIV -(0) ÷ 1 > -A[1] OR ¬true EQUIV ¬true;
            B := ¬false EQUIV .1 = 1 IMPL true IMPL 0 NOTEQUAL 1;
            for I := 1 while true do
              goto EXIT;
            EXIT: for I := I while false do
              if -0 NOTLESS +6 then for N := 1 while 0 NOTLESS -1 OR +N NOTLESS +(1) do
              for N := 1 do ;
            B := 0 < 101 IMPL +1 NOTLESS .1 OR -3 NOTLESS -6 IMPL true IMPL +1 NOTLESS 101;
            B := B IMPL -(1) < (2) EQUIV 101 = .1 IMPL -(1) NOTLESS 0;
            if C[1] IMPL ¬+1 = 101 then ;
            X := A[1] POWER .5 POWER 101 + (if ¬N NOTLESS .1 OR (if true then false else true) then -1 else +2);
            begin;
                integer procedure A0(B, C);
                  Boolean B, C;
                A0 := if B IMPL ¬C then (1) POWER 2 else if C IMPL ¬B then (1) else (2);
                X := X + A0(true, false) + A0(false, true IMPL .4 < .6);
                N := X TIMES A0(¬0 = 101, 1 NOTLESS 102) - A0(¬-1 > .1, ¬.1 NOTLESS (1));
            end ;
            begin;
                goto L4;
                L4: begin;
                    for I := I step if 1 < 2 then 1 else 2 until -10 do ;
                end ;
                if if B then .1 > 101 else ¬101 NOTEQUAL .6 then begin;
                    X := X + 100;
                end  else for I := 1 step .3101 until if ¬(false) then 1 else A[1] do
                  B := true;
            end ;
            B := false;
        end ;
        begin;
            real Y;
            array D[C0[0] : +A[1] ÷ 1 + 1 + C0[0]];
            Boolean procedure B1;
            begin;
                own Boolean  X;
                X := if D[0] < 0 then ¬D[0] NOTLESS (0) IMPL (D[0] NOTLESS (1)) else B;
                B := X IMPL 101 + D[0] > (1) EQUIV (D[0] NOTEQUAL 0);
                B1 := B OR 101 + D[0] = D[0] EQUIV (1) > D[0];
            end ;
            switch S := L10, L11;
            D[0] := 0;
            B := B1 IMPL 101 + (1) NOTEQUAL D[0] IMPL B;
            L10: ;
            L11: ;
        end ;
        begin;
            switch SS := LA, LB;
            own integer  P;
            procedure Q(L);
              label L;
            begin;
                array R[(0) : -(-1)], S[1 : 101];
                for I := 0,
                      +1,
                      .3,
                      101,
                      (2),
                      if B then 0 else 1 do
                  begin;
                end ;
                for I := 1 while I + (0) NOTLESS 9,
                      I + 1 while +I < 10 do S[I] := 0;
                for I := 1 + S[2] while -I > 0,
                      I + (1) while ¬I NOTLESS 10 do
                  if B then ;
            end ;
            Q(LA);
            LA: ;
            LB: ;
        end ;
        begin;
            procedure P;
            begin;
                ;
                for I := 1 while if 1 < 2 then 0 = A[1] else (A[1]) > 0 do ;
            end ;
            array D[1 : if 1 < 2 then 2 else 1];
            for I := 1 while .1 < -3,
                  I + 1 while (I) < 3 do D[I] := I;
            for I := D[2],
                  1 step (1) until (1) do
              if 1 < 2 then L:  else begin;
            end ;
            P;
            for I := 1 step 101 - 9 until 101 - 9,
                  1 while 101 > 11 do X := X + N;
        end ;
        OUTREAL(99, X + N);
    end ;
end ;