this problem complicate version d1 significant difference read statementpolycarp array n n integer a_1 a_2 dot a_n Polycarp conceive positive integer k after Polycarp begin perform follow operation array index 1 le le n reduce number a_i kAfter Polycarp perform possibly zero number operation turn half number array find maximum k situation possible print 1 number arbitrarily large