SP3466 CS - Another Longest Common Subsequence Problem

Given a non-negative integer **X**. Calculate the smallest non-negative integer **Y**, such that **Y**

Multiple test cases. Each test case contains one line with one integer **X** (0

For each test case output one line with one integer **Y**.