#include <iostream>
#include <math.h>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>

using namespace std;
const int INF = 1 * (1 << 30);
const int mINF = -1 * (1 << 30);

int main()
{
  string s;
  cin >> s;
  if (s.find(".") != string::npos)
  {
    s.erase(s.find("."));
  }
  cout << s << endl;
  return 0;
}

#include<bits/stdc++.h>
using namespace std;
#define _ 0
const int maxn=1e5+5;
const int inf=0x3f3f3f3f;
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    //freopen(".in","r",stdin);
    //freopen(".out","w",stdout);
    string x;
    cin>>x;
    for(int i=0;i<=x.size()-1;i++)
    {
    	if(x[i]=='.')
    		break;
    	cout<<x[i];
	}
	return ~~(0^_^0);
}
