#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for (auto i = a; i < (b); ++i)
#define repr(i, a, b) for (auto i = (a) - 1; i >= (b); --i)
#define pb push_back
#define eb emplace_back
#define all(x) begin(x), end(x)
#define sz(x) int((x).size())

using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vll = vector<ll>;
using vii = vector<pii>;

template<class T>
inline bool cmax(T &a, const T& b) {
    return a < b ? a = b, 1 : 0;
}

template<class T>
inline bool cmin(T &a, const T &b) {
    return b < a ? a = b, 1 : 0;
}

const int inf = 0x3f3f3f3f;
const ll linf = 1e18;
const double dinf = numeric_limits<double>::infinity();

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);

    string s;
    cin >> s;

    int sz = s.size();

    string t = s;
    for (int i = 1; i < sz; i++) {
        t[i] = '0';
    }

    ll n1 = stoll(t);
    ll po = 1;
    for (int i = 0; i < sz-1; i++) po *= 10;
    ll n2 = n1+po;

    ll res = n2;
    ll n = stoll(s);
    if (abs(n-n1) < abs(n-n2)) res = n1;

    cout << res << endl; 
}
/*
4 100
44 35 66 67
*/