import sys import heapq def can_finish(H, t): # simulate using powers 2^{t-1}, 2^{t-2}, ..., 2^0 # use a max-heap of remaining healths (store negatives) if t == 0: return all(h <= 0 for h in H) heap = [-h for h in H if h > 0] heapq.heapify(heap) for k in range(t - 1, -1, -1): if not heap: return True largest = -heapq.heappop(heap) largest -= (1 << k) if largest > 0: heapq.heappush(heap, -largest) return not heap # True if all monsters defeated def main(): data = sys.stdin.buffer.read().split() if not data: return it = iter(data) n = int(next(it)) H = [int(next(it)) for _ in range(n)] # binary search minimal t in [0, 62] lo, hi = 0, 62 while lo < hi: mid = (lo + hi) // 2 if can_finish(H, mid): hi = mid else: lo = mid + 1 print(lo) if __name__ == "__main__": main()