#include <vector>
#include <map>
#include <sstream>
#include <string>
#include<iostream>
#include<cstdio>
#include <algorithm>
#include<iomanip>
#include<algorithm>
#include<cmath>
#include<set>
#include<stack>
#include<queue>
#include<cstring>
using namespace std;
int main()
{
int n;
while (cin >> n && n)
{
queue<int>cards;
for (int i = 0; i < n; ++i)
{
cards.push(i + 1);
}
cout << "Discarded cards:";
if (cards.size() > 1)
cout << " ";
while (cards.size() > 1)
{
int p1 = cards.front();
cards.pop();
int p2 = cards.front();
cards.pop();
cards.push(p2);
cout << p1;
if (cards.size() >= 2)
cout << ", ";
}
cout << endl;
cout << "Remaining card:";
if (cards.size() > 0)
cout << " ";
cout<< cards.front() << endl;
}
}