Y by
Let
be a positive integer. Egor has
cards with the number “
” written on them, and
cards with the number “
” written on them. Egor wants to paint each card red or blue so that no subset of cards of the same color has the sum of the numbers equal to
. Find the greatest
such that Egor will not be able to paint the cards in such a way.






