Program BEGUNOK;
Uses CRT, GRAPH;
Var X, Y, Z, H, S : integer;
Var SW : Array [1 . . max] of integer;
Var WCL : Array [1 . . max] of integer;
Begin
  X:=Oksa;
  Y:=Arfa;
  Z:=Kaktus;
  S:=school;
  H:=home;
  SW [1 . . max]:=spiritual world;
  WCL [1 . . max]:=World Carp Latvia;
  Repeat
    X goto S;
    X goto WCL;
    X goto H;
  Until X=SW;
  If X has got free time then
    X goto Z+Y;
  Else X goto WCL;
{But unfortunately X has not free time...}
Readln;
End.