Jason has n coins, among which at most one of them is counterfeit. The counterfeit coin (if there is any) is either heavier or lighter than a real coin. Jason’s grandfather also left him an old weighing balance, on which he can place any number of coins on either side and the balance will show which side is heavier. However, the old weighing balance is in fact really really old and can only be used 4 more times. What is the largest number n for which is it possible for Jason to find the counterfeit coin (if it exist)?