Cycles/Even nums[K]

procedure ReadNum(var inp:longint);
begin
  read(inp);  //read num
end;
procedure WriteNum(inp:longint);
begin
  writeln(inp);  //write num
end;
function FindNumEvenNums(inp:longint):longint;
var outp:longint;
begin
  outp:=0;  //firstly output value eq 0
  repeat  //repeat cycle until inputted num eq 0
    if (inp mod 10)mod 2=0 then  //if last discharge of inputted num is even
      outp:=outp+1;  //add to output 1
    inp:=inp div 10;  //cut the last discharge in inputted num
  until inp=0;  //end of the cycle
  FindNumEvenNums:=outp;
end;
var n,outp:longint;
begin
  ReadNum(n);   //read 1 num
  WriteNUm(FindNumEvenNums(n));  //write count of even digit in inputted value
end.