Consider a rectangular grid of $ 10 \times 10$ unit squares. We call a ship a figure made up of unit squares connected by common edges. We call a fleet a set of ships where no two ships contain squares that share a common vertex (i.e. all ships are vertex-disjoint). Find the greatest natural number that, for each its representation as a sum of positive integers, there exists a fleet such that the summands are exactly the numbers of squares contained in individual ships.