Alternating LG Queries

You are given an array $A$ consisting of $N$ integers. You have to answer $Q$ queries of the following two types: - $1$ $L$ $R$ $(R > L)$ which asks you to find $\gcd(A_L, lcm(A_{L + 1}, \gcd(A_{L + 2}, ... , ((R - L) \bmod 2 == 1 ? $ $\gcd(A_{R - 1}, A_{R}) : lcm(A_{R - 1}, A_{R}))\ldots)))$. - $2$ $L$ $R$ $(R > L)$ which asks you to find the same as above but $lcm$ swapped with $\gcd$ and vice