The congruences of two-generated monoid which generated by pair of words of length 2 are considered over two-letter alphabet. It is shown that number of equivalence classes for words of length n is equal to n + 1. The number of words in each class is found.
