#include<iostream>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<string>
#include<cassert>
#include<cctype>
#include<memory.h>
#include<cstdio>
#include<sstream>
#include<vector>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<cstdlib>
using namespace std;
// 这道题考队列基本用法
int main()
{
int n = 0;
while (cin >> n&&n)
{
queue<int> Q;
int flag = 0;
//cin >> n;
for (int i = 1; i <= n; i++)
Q.push(i);
cout << "Discarded cards:";
if (n == 1) //这道题坑多 n=1时单独讨论 且第一行无额外空格
{
cout << endl<<"Remaining card: 1" << endl;
continue;
}
cout << " ";
while (Q.size() > 1)
{
if (flag == 0)
{
if (Q.size() > 2)
cout << Q.front() << ", ";
else
cout << Q.front() << endl;
Q.pop();
flag = 1;
}
else
{
int t = Q.front();
Q.pop(); Q.push(t);
flag = 0;
}
}
cout << "Remaining card: " << Q.front() << endl;
}
}