#include <bits/stdc++.h>
// #include <boost/multi_array.hpp>
// #include <boost/optional.hpp>
// #include <boost/range/irange.hpp>
// #include <boost/range/algorithm.hpp>
// #include <boost/range/adaptors.hpp>
// #include <atcoder/all>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep2(i, x, n) for(int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
const int INF = 1e9;
const long long llINF = 1LL << 60;

void print() { cout << endl; }

template <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {
    cout << head;
    if(sizeof...(tail) != 0)
        cout << " ";
    print(forward<Tail>(tail)...);
}

template <class T> void print(vector<T> &vec) {
    for(auto &a : vec) {
        cout << a;
        if(&a != &vec.back())
            cout << " ";
    }
    cout << endl;
}

template <class T> void print(vector<vector<T>> &df) {
    for(auto &vec : df) {
        print(vec);
    }
}

string conv(string s) {
    rep(i, s.size()) s[i] ^ 32;
    return s;
}

class Radix {
  private:
    const char *s;
    int a[128];

  public:
    Radix(const char *s = "0123456789ABCDEF") : s(s) {
        int i;
        for(i = 0; s[i]; ++i)
            a[(int)s[i]] = i;
    }
    std::string to(long long p, int q) {
        int i;
        if(!p)
            return "0";
        char t[64] = {};
        for(i = 62; p; --i) {
            t[i] = s[p % q];
            p /= q;
        }
        return std::string(t + i + 1);
    }
    std::string to(const std::string &t, int p, int q) {
        return to(to(t, p), q);
    }
    long long to(const std::string &t, int p) {
        int i;
        long long sm = a[(int)t[0]];
        for(i = 1; i < (int)t.length(); ++i)
            sm = sm * p + a[(int)t[i]];
        return sm;
    }
};

vector<long long> calc_factorial(int n, int mod) {
    vector<long long> factorial(n + 1);
    factorial[0] = 1; // 0 の階乗は 1
    for(int i = 1; i <= n; i++) {
        factorial[i] = (factorial[i - 1] * i) % mod;
    }
    return factorial;
}

template <typename T> vector<pair<T, T>> prime_factor(T n) {
    vector<pair<T, T>> ret;
    for(T i = 2; i * i <= n; i++) {
        if(n % i != 0)
            continue;
        T tmp = 0;
        while(n % i == 0) {
            tmp++;
            n /= i;
        }
        ret.push_back(make_pair(i, tmp));
    }
    if(n != 1)
        ret.push_back(make_pair(n, 1));
    return ret;
}

void Main() {
    string n;
    cin >> n;
    if(n[0] == '-') {
        cout << 0 << endl;
        return;
    }
    if(n.size() < 3) {
        cout << 0 << endl;
        return;
    }
    cout << n.substr(0, n.size() - 2) << endl;
}

int main() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << std::fixed << std::setprecision(4);
    Main();
    return 0;
}