After losing to Vampire, Foxtrot wants to take revenge.

Vampire has $30$ piles of coins, each contains $N$ number of coins. Every gold coin weighs $10$ grams, while counterfeit coin weighs $9$ grams. Some of the piles contains all counterfeit coins. He have a digital scale capable of accurately weighing any number of coins. He knows that at most $3$ of the $30$ piles are counterfeit. He needs to find the minimum value of $N$ so that, with just one measurement, he can guarantee identifying which (if any) piles are counterfeit. Vampire is busy in some work and says if Foxtrot can solve this for him, he will declare Foxtrot as the best hacker.

Find the answer for Foxtrot.