Ladoos and Modaks

Amidst the joyful Ganpati Bappa celebrations, there was a special quest. People searched for silky numbers, those that matched perfectly with all the numbers in an array. It was like finding a hidden treasure during the festive spirit of Lord Ganesha. You are given an array $a$ with $n$ integers. An integer $x$ is said to be silky if for every $a_i$ for $1 \leq i \leq n$, $\text{gcd}(a_i, x) = 1$