For each lattice point on the Cartesian Coordinate Plane, one puts a positive integer at the lattice such that for any given rectangle with sides parallel to coordinate axes, the sum of the number inside the rectangle is not a prime. Find the minimal possible value of the maximum of all numbers.