#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define all(x) (x).begin(),(x).end()
using namespace std;
/***
* 链接:https://vjudge.net/problem/UVALive-2889
* 求第n个回文数字,n<=2e9;
*/
ll sum[22],a[22];
ll fac[22];
int main() {
int kk=0;
sum[1]=9;
ull ret=9;
for(int i=2;i<=21;i++){
if(i&1) ret*=10;
sum[i]=sum[i-1]+ret;
}
fac[0]=1;
for(int i=1;i<=11;i++) fac[i]=fac[i-1]*10;
ll n;while (cin>>n){
if(n==0) break;
if(n<=9) {
cout<<n<<endl;
continue;
}
n--;
ll len=0;
for(int i=1;;i++){
len++;
if(sum[i]>n) break;
}
ll zx=(len-1)/2;//中间一般可自由填充的数字的长度
ll res=n-sum[len-1];//后面部分第几个回文数字
ll maxx=res/fac[zx]+1;//回文数字开头
ll ret=res%fac[zx];//中间填充的数字
string ans,tmp;
for(int i=1;i<=zx;i++) ans+=(ret%10+'0'),ret/=10;
reverse(all(ans));
tmp=ans;
reverse(all(tmp));
if(len&1) tmp.erase(tmp.begin());//考虑长度为奇数,得删除头
ans+=tmp;
ans.insert(ans.begin(),maxx+'0');
ans.insert(ans.end(),maxx+'0');
cout<<ans<<endl;
}
return 0;
}
/*
* 1000
*
* 1001
* 90209
*/