Time Limit: 1000MS
Memory Limit: 65536K
Set S is defined as follows:
(1) 1 is in S;
(2) If x is in S, then 2x + 1 and 3x + 1 are also in S;
(3) No other element belongs to S.
Find the N-th element of set S, if we sort the elements in S by increasing order.
Input will contain several test cases; each contains a single positive integer N (1 <= N <= 10000000), which has been described above.
For each test case, output the corresponding element in S.