How to check the parity of a quaternary number?

Question

Algorithms

The task of compiling NAM

A = {0,1,2,3}. Considering a non-empty word as a quaternary number, check whether it is even or not.
Answer: word 0 if even, and word 1 otherwise.

I can not understand, on what basis to determine parity?

Answer 1

Whether the lowest digit is divisible by 2 - the last digit is 0 or 2, then even.