CodeLab Academy 📞 9936 6696
← List Python · Level 10: Algorithms Code · 100 points ← #973 #975 →

#974. Josephus problem (k=3)

n people stand in a circle (1..n). Counting from 1, every 3-th person leaves. Find the number of the last person left. ### Input One integer n (1 ≤ n ≤ 1000). ### Output A number.

Examples

Input
74
Output
13
Input
202
Output
134

💡 You can solve it with Python, JavaScript or blocks. Read the input line by line with input(). Don't print a question (like input("Number: ")). Print exactly what the output asks for, nothing more.

🔒 You can solve the first 3 problems without an account. Sign up for free to solve this one!