Question 82
There are some number of green crawlers in the lowest leftmost unit square and some number of brown crawlers in the highest leftmost unit square of the grid $2014 \times 2014$. Each green crawler at each move can pass to the neighboring square located at its up or at its right. Each brown crawler at each move can pass to the neighboring square located at its down or at its right. It turns out that after some number of moves each unit square was visited by at least one crawler. Find the minimal possible number of crawlers.