#include <iostream>
#include <stdio.h>
#include <vector>
#include <map>
#include <stack>
#include <cstring>
#include <utility>
#include <list>
#include <queue>
#include <algorithm>
#include <cmath>
#include <unordered_set>
#include <bitset>
#define FOR(i,a,b) for (ll i=(a);i<(ll)(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define SUM(v) accumulate(ALL(v),0ll)
using ll = long long;
const int INF=20000;
using namespace std;
ll func(ll n)
{
    if(n==0)return 1;
    return n*func(n-1);
}

int main()
{
    string s;
    cin>>s;
    vector<ll> ans;
    if(s.size()<=2)
    {
        cout<<0<<endl;
        return 0;
    }
    if(s[0]-'0'<=0)
    {
        cout<<0<<endl;
        return 0;
    }
   
       
    for(int i=0;i<s.size()-2;i++)
    {
        cout<<s[i];
    } 
    cout<<endl;
    //cout<<"00"<<endl;
    return 0;   
}