There is a row that consists of digits from 0 to 9 and Ukrainian letters (there are 33 of them) with following properties: there aren’t two distinct digits or letters ai, aj such that ai>aj and i<j (if ai, aj are letters ai>aj means that ai has greater then aj position in alphabet) and there aren’t two equal consecutive symbols or two equal symbols having exactly one symbol between them. Find the greatest possible number of symbols in such row. inequalitiescombinatorics unsolvedcombinatoricsalgebra