There are two letter sequences $A$ and $B$, both with length $100$ letters. In one move you can insert in any place of sequence ( possibly to start or to end) any number of same letters or remove any number of consecutive same letters. Prove that it is possible to make second sequence from first sequence using not more than $100$ moves.