#include <bits/stdc++.h>

#define ll long long

#define pb push_back
#define el '\n'
#define pi 3.1415926536
#define mod 1000000007

#include <sstream>

#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)

#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;
template<typename T>
using pbds = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;


int const N = 2e5+5;

map<int, int>mp;
map<int, int> freqq;
map<pair<ll, ll>, ll> mpp;
vector<pair<ll,ll>>adj[N],adj2[N];
deque<pair<int,int>>pq2;
//priority_queue<pair<ll,ll>,vector<pair<ll,ll>>,greater<>>pq;

int dx[] = { 1, -1,0, 0 };
int dy[] = { 0,0, 1,-1  };
int chess_x[] = { -1,-1,1,1, 1, -1, 0, 0 ,0};
int chess_y[] = { 1, -1,1,-1, 0,0, 1,-1,0 };
ll a[N];
ll n,ans=0;


int main()
{
    fast;
    ll n,a[4];cin>>n;
    string s;
    s= to_string(n);
    ll num= s[0]-'0';
    while(num<n){
        num*=10;
    }
    string s1= to_string(num);
    if(s1.size()>s.size()) {
        num /= 10;
    }
    a[0]=num;
    ll num2=s[0]-'0';
    if(num2!=1)num2--;
    while(num2<n){
        num2*=10;
    }
    string s2= to_string(num2);
    if(s2.size()>s.size())
    num2/=10;
    a[1]=num2;
    ll o=0,num3=s[0]-'0';
    if(num3==9)o=1;
    num3++;
    while(num3<n){
        num3*=10;
    }
    string s3= to_string(num3);
    if(s3.size()>s.size()) {
        num3 /= 10;
    }
    if(o)a[3]=num3*10;
    a[2]=num3;
    sort(a,a+4);
   // cerr<<a[0]<<" "<<a[1]<<" "<<a[2]<<" "<<a[3];
    if(abs(a[3]-n)<=abs(a[1]-n)&&abs(a[3]-n)<=abs(a[0]-n) && abs(a[3]-n)<=abs(a[2]-n))cout<<a[3]<<el;
    else if(abs(a[2]-n)<=abs(a[1]-n)&&abs(a[2]-n)<=abs(a[0]-n) && abs(a[2]-n)<=abs(a[3]-n))cout<<a[2]<<el;
    else if(abs(a[1]-n)<=abs(a[0]-n)&&abs(a[1]-n)<=abs(a[2]-n)&&abs(a[1]-n)<=abs(a[3]-n))cout<<a[1]<<el;
    else cout<<a[0];



    return  0;
}