Problem:
One hundred points labeled to are arranged in a grid such that adjacent points are one unit apart. The labels are increasing left to right, top to bottom (so the first row has labels to , the second row has labels to , and so on).
Convex polygon has the property that every point with a label divisible by is either on the boundary or in the interior of . Compute the smallest possible area of .