Chef And Babla

Chef gives an array $A$ with $N$ elements to Babla. Babla's task is to find the **maximum non-negative** integer $X$ such that: - No element in the array belongs to the range $[-X, X]$. In other words, for all $(1\le i \le N)$, either $A_i \lt -X$ or $A_i \gt X$. Help Babla to find the **maximum non-negative** integer $X$ for which the given condition is satisfied or determine if no such $X$ exi