#include <bits/stdc++.h> 
using namespace std; 
#define ll long long
#define ld long double
const ll mod = 1000000007;

int main()
{
    #ifndef ONLINE_JUDGE
    // for getting input from input.txt
    freopen("input.txt", "r", stdin);
    // for writing output to output.txt
    freopen("output.txt", "w", stdout);
    #endif
    string s,str;
    cin>>s;
    ll i,n=s.length();
    for(i=0;i<n;i++)
    {
        if(s[i]=='.')
        {
            break;
        }
        else
            str=str+s[i];
    }
    cout<<str<<"\n";

}
#include<bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for(int i = (a); i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define endl '\n'

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;

const ll mod = 1000000007;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

ll dp[201][13];

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

    // if a == b or b == 0 => C = 1
    int l;
    cin >> l;
    memset(dp,0,sizeof(dp));
    dp[0][0] = 1;
    for(int i = 0; i < l; i++) {
    	for(int j = 0; j < 12; j++) {
    		if(dp[i][j] == 0) continue;
    		dp[i + 1][j] += dp[i][j];
    		dp[i + 1][j + 1] += dp[i][j];
    	}
    }
    cout << dp[l - 1][11] << endl;
    return 0;
}
