Use a deterministic finite-state automaton (FSA) engine from the TaskE00.
Create your own FSA description to check whether the string contains "0"
even number of times.
Don't use external files like in TaskE00 (description should be included in run file).

The alphabet is "0", "1".

Read strings from the standard input.
If a string is accepted by the
automaton, write YES, otherwise- write NO.

POINTS: 3
DEADLINE: 2020-12-24 15:30:00
REMAINDER: 3/4