#include<iostream>
using namespace std;

#define maxn 40

int JosePh(int k, int m)
{
    int i=0, a[maxn]={0}, n=2*k, T=k;

    while(T--)
    {
        int j=0;

        int t = (m+k+T+1)%(k+T+1);

        while(j<=t)
        {
            if(i == n)i=0;
            if(a[++i] == 0)
                j++;
        }

        if(i <= k)
            return 0;
        a[i] = 1;
    }

    return 1;
}

int main()
{
    int i, k, a[maxn]={0};

    for(k=1; k<14; k++)
    {
     for(i=1; ; i++)
        {
            if(JosePh(k, i) == 1)
                break;
        }
    a[k] = i+1;
    }
    while(cin >> k, k)
    {
        cout << a[k] << endl;
    }

    return 0;
}


//93313