#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define all(v) v.begin(),v.end()
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;
template<class T> void chmin(T &a,const T &b){if(a>b) a=b;}
template<class T> void chmax(T &a,const T &b){if(a<b) a=b;}

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  string S;
  cin>>S;
  if(S[0]=='-'){
    cout<<0<<endl;
    return 0;
  }

  int N=S.size();
  if(N<=2){
    cout<<0<<endl;
    return 0;
  }
  
  string ans="";
  for(int i=0;i+2<N;i++) ans+=S[i];
  cout<<ans<<endl;

  return 0;
}