A word is called fair if it contains, for each pair of distinct symbols , the same number of occurrences of the scattered subword ab as of ba. We prove that if the first words in the sequence generated by a system over a k-letter alphabet are fair then all words in the sequence are fair.