Find the smallest integer nnn such that GCD(n,2)=1,GCD(n,3)=1,GCD(n,5)=1\text{GCD}(n, 2)=1, \text{GCD}(n, 3)=1, \text{GCD}(n, 5)=1GCD(n,2)=1,GCD(n,3)=1,GCD(n,5)=1 and n>30n > 30n>30.
31
33
35
37