#include <iostream>
#include <iomanip> 
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <queue>
#include <deque>
#include <bitset>
#include <iterator>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <functional>
#include <numeric>
#include <utility>
#include <limits>
#include <time.h>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h> 
#include <climits>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define int long long
#define pb push_back			

int ri() {
	int n;
	cin>>n;
	return n;
}

void solve() {
	int x = ri();
	if(x>=0) {
		cout<<x;
		return;
	}
	cout<<0<<endl;
}


int32_t main() {
	IOS;
#ifndef ONLINE_JUDGE
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
#endif
	
	int t = 1;
	while(t--) {
		solve();
	}
	return 0;

}
	




















//#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC target("avx,avx2,sse,sse2")
#include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (ll i = j; i <= n; i++)
#define per(i, j, n) for (ll i = j; i >= n; i--)
#define ll long long
#define ld long double
#define ld long double
#define ii pair<ll, ll>
#define vii vector<ii>
#define vi vector<ll>
#define adj unordered_map<ll, vii>
#define MOD 1000000007
#define PI 3.14159265359
#define db1(x) cout << #x " = " << x << endl;
inline ll add(ll a, ll b) { return ((a % MOD) + (b % MOD)) % MOD; }
inline ll mul(ll a, ll b) { return ((a % MOD) * (b % MOD)) % MOD; }
inline ll sub(ll a, ll b) { return ((a % MOD) - (b % MOD) + MOD) % MOD; }

template <typename T> void i1d(vector<T> &v) {
  for (auto &i : v)
    cin >> i;
}

template <typename T> void p1d(const vector<T> &v) {
  for (auto i : v)
    cout << i << ' ';
  cout << endl;
}

ll t = 1;
ll x;

void solve() {
  // Code goes here
  cin >> x;
  if (x >= 0)
    cout << x << '\n';
  else
    cout << 0 << '\n';
}

int main() {
  ios::sync_with_stdio(false);
  // cin >> t;
  rep(i, 1, t) {
    // cout<<"Case #" << i << ": ";
    solve();
  }
}
