#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define MOD 1000000007
const int INF = 1e9;
const int N = 100005;
/*   => int overflow
     => array bounds 
     => special cases (n=1?)
     => do smth instead of nothing 
     => stay organized 
     => WRITE STUFF DOWN DON'T GET STUCK ON ONE APPROACH
     =>Read Stuff At Bottom !
*/

/*
struct DSU
{
    vector<int> sz;
    vector<int> parent;
    vector<int> value;
    void make_set(int v) {
        parent[v] = v;
        sz[v] = 1;
        value[v] = 0;
    }
 
    int find_set(int v) {
        if (v == parent[v])
            return v;
        else
        {
            auto par = find_set(parent[v]);
            value[v]^=value[parent[v]];
            parent[v] = par;
            return par;
        }
    }
 
    void union_sets(int a, int b, int w) {
        find_set(a);
        find_set(b);
 
        w^=value[a]; w^=value[b];
        a = find_set(a);
        b = find_set(b);
 
        if (a != b) {
            if (sz[a] < sz[b])
                swap(a, b);
            parent[b] = a;
            value[b] = w;
            sz[a] += sz[b];
        }
    }
 
    int val(int v)
    {
        find_set(v); return value[v];
    }
 
    DSU (int n)
    {
        parent.resize(n);
        sz.resize(n);
        value.resize(n);
        for (int i = 0; i<n; i++) make_set(i);
    }
};
*/
void solve(){
	string x,ans ; cin>>x;
	for(auto i:x)
	{
		if(i=='.')
			break;
		else{ans.push_back(i);};
	}
	cout<<ans<<endl;
}

void Solve()
{
	int t ; cin>>t;
	while(t--)
	{
		
	}
}
int main(){
	ios_base::sync_with_stdio(0);   cin.tie(0);  cout.tie(0);
	#ifndef ONLINE_JUDGE
		freopen("input.in", "r", stdin);
		// freopen("king.out","w",stdout);
	#endif
	// Solve();
	solve();
	return 0;
}
#include <iostream>
#include <string>
#include <list>

using namespace std;

int main() {
    string input;
    getline(cin, input);
    for(int i=0; i<input.size(); i++)
        if(input[i]!='.')
            cout << input[i] << "";
        else
            break;
    return 0;
}
