Find the Nth pair of twin primes Two prime numbers are defined as twin primes if they differ by two. For example, 3 and 5 are twin primes as are 29 and 31.

Write a program that finds the nth pair of twin primes (where n comes from STDIN) and prints them on STDOUT, separated by a comma and a space. This is code-golf, so the shortest code wins.

Sample input:

3


Sample output:

11, 13
Haskell 118
main=putStrLn.(!!)[show n++&quot;, &quot;++show(n+2)|n&lt;-[2..],all((&gt;0).rem n)[2..n-1],all((&gt;0).rem(n+2))[2..n]].(+)(-1)=&lt;&lt;readLn

Brute-force all twin primes and prints the nth pair.