//#include <bits/stdc++.h>
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <math.h>
#include <iomanip>
 
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

#define rep(i,n) for(int i = 0; i < (n); i++)
#define pb push_back 
#define eb emplace_back 
#define all(x) x.begin() , x.end()
#define fi first
#define se second
#define Yes() {puts("YES");return;}
#define No()  {puts("No"); return;}
#define P pair <int , int>
#define vb vector<bool>
#define vi vector<int> 
#define vll vector<ll> 
#define vvi vector<<vector<int>> 
#define vs vector<string> 
#define vP vector<P>
#define ssz s.size()
#define tsz t.size()
#define ext exit(0)
 
const ll mod = 1000000007;
//const ll mod = 998244353;
const ld PI = 3.14159265358979;
const int INF = 1001001001;
const ll LINF = (1LL << 60);
const int MX = 200005;//DP...?

ll gcd (ll a , ll b) {if (a < b) swap(a , b);if (b == 0) return 1;if (a % b == 0) return b;else return gcd (b , a % b);}
bool is_2power (ll x) { if((x & (x - 1)) == 0) return true; else return false;}
ll keta (ll x) {ll ret = 0; while (x) {x /= 10;ret++;} return ret;}

bool is_prime (ll x) {
    if (x == 1) return false;
    if (x == 2 || x == 3 || x == 5 || x == 7) return true;
    if((x & 1) == 0) return false;
    for (ll i = 3; i * i <= x; i += 2) if(x % i == 0)return false;
    return true;
}

void is_prime2() {
    const int sz = 10001; //使う時は外に出す
    vb table(sz , 0); //使う時は外に出す
    for (int i = 2; i < sz; i++) {
        for(int j = 2; i * j <= sz; j++) {
            table[i * j] = true;
        }
    }
}

vector<int> divisor (ll x) {
    vector<int> ret;
    for (int i = 2; i * i <= x; i++) {
        while (x % i == 0) {
            ret.push_back(i);
            x /= i;
        }
    }
    if (x > 1) {
        ret.push_back(x);
    }
    return ret;
}

ull modpow (ull x , ull p , ull m) {
    cout << x << " : " << p << " : " << m << endl;
    ull ret = 1;
    while (p > 0) {
        if (p & 1) {
            ret *= x;
            ret %= m;
        }
        x = x * x;
        x = x % m;
        cout << x << endl;
        p >>= 1;
    }
    return ret;
}

/** memo **/
//vs ans;
//int n;
//vi dp(n + 10 , 0);
//v.erase(unique(v.begin(), v.end()), v.end());


void solve() {
    return;
}

int main() {    
    cin.tie(0);
    ios::sync_with_stdio(false);
    string s;
    cin >> s;
    if(s[0] == '-' || ssz <= 2){
        cout << 0 << endl;
        ext;
    }
    rep(i,ssz - 2){
        if (i == 0) {
           cout << s[i]; 
        } else {
            cout << 0;
        }
    }
    cout << endl;
    return 0;
}