three sailors have collected some coconuts, which they plan to divide in the morning. not trusting the others, during the night the first sailor decides to take his share. he divides the coconuts into three piles; there is one left over, which he gives to the monkey. he then takes his share, and leaves the remaining coconuts in the pile. the second sailor does the same using the new smaller pile, and the third does likewise with the leftover pile from the second sailor. in the morning, the sailors divide the remaining pile of coconuts into thirds, and again there is one left over, which they give to the monkey. intrigued by this problem, you create a program coconuts.py to compute the minimum number of coconuts that could have been in the original pile. you use a function calculate() to find the number, which is then returned to the main function to print.