The total program reads the word into an array, validates the syntactic conditions of $WellFormed$ in linear time, checks that every listed edge crosses the split while counting the degrees of the symmetrized word, builds that word by a counting sort (each left row the union of its own row and the transposed right rows), runs Kuhn's algorithm on it and compares the size of the matching with the number of left vertices; on any failed check it answers $0$. The program is compiled for the length-prefixed word, runs at every word length from $bitSize x + 11$ on, and within $20000 · (bitSize x + 1)²$ instructions.