#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 0x3f3f3f
const int maxn=300;
double dp[maxn];
void f()
{
int i;
dp[0]=0;
for(i=1;i<=maxn;i++){
dp[i]=dp[i-1]+1.0/(double)(i+1);
}
}
int main()
{
double t;
f();
while(EOF!=scanf("%lf",&t) && 0!=t)
{
int l=1,r=maxn,mid;
while(l<=r){
mid=(r+l)/2;
if(dp[mid]>t)
r=mid-1;
else
l=mid+1;
}
int i;
for(i=mid-1;;i++){//因为是>=二分查找的时候,不好确定目标的位置,所以我就从mid-1开始遍历
if(dp[i]>=t){
cout << i << " card(s)" << endl;
break;
}
}
}
}