Question 53
A king has 10 fools. Each fool amuses the king by weeks that start and end at Sunday midnight, whereby for every $n = 1, \dots, 10$, there exists a fool whose every two consecutive working weeks are separated by exactly $n$ free weeks. When no fool is present, the king feels bored. How many consecutive days at most is it possible to avoid the king feeling bored under such circumstances?