The Coin Problem!
Everyone receives at least one coin.
Aaron gets fewer coins than Brian, who gets fewer coins than Calvin, who gets fewer than Daniel, who gets fewer than Peter.
Each person knows only the total \(n\) and how many coins he got.
What is the smallest possible value of \(n\) such that there exists atleast one possible configurational distribution of the coins such that nobody can deduce the number of coins received by each of the others without more information?