Gridlock

Number Theory Level 4

Use 25 distinct positive integers to fill up the grid, such that the integers in any two connected squares have a greatest common divisor that is greater than 1.

What is the smallest possible value of the largest positive integer used?

Variation on a Theme.