Find the smallest integer nnn such that gcd(n,2)=1,gcd(n,3)=1,gcd(n,5)=1\gcd(n, 2)=1, \gcd(n, 3)=1, \gcd(n, 5)=1gcd(n,2)=1,gcd(n,3)=1,gcd(n,5)=1 and n>30n > 30n>30.
31
37
41
49