In a faraway place in the Universe, a villain has a medal with special powers and wants to hide it so that no one else can use it. For this, the villain hides it in a vertex of a regular polygon with $2019$ sides. Olcoman, the savior of the Olcomita people, wants to get the medal to restore peace in the Universe, for which you have to pay $1000$ olcolones for each time he makes the following move: on each turn he chooses a vertex of the polygon, which turns green if the medal is on it or in one of the four vertices closest to it, or otherwise red. Find the fewest olcolones Olcoman needs to determine with certainty the position of the medal.