/*
* @author:  codancer
* @createTime:  2020-11-16, 22:37:41
*/

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <bitset>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
const ll mod = 1e9+7;
#define pb push_back
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define fep(i,a,b) for(int i=(a);i>=(b);i--)
#define deb(x) cerr<<#x<<" = "<<(x)<<"\n"
typedef vector<int> VI;
typedef vector<ll> VII;
typedef pair<int,int> pii;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll Rand(ll B) {
	return (ull)rng() % B;
}
int main(){
	int n;
	cin>>n;
	if(n<0){
		n=0;
	}
	cout<<n<<endl;
	return 0;
}
#include<bits/stdc++.h>
#define ll long long
#define test(t) int t;cin>>t;while(t--)
using namespace std;

int main()
{
	ll x;
	cin>>x;
	if(x<0)
		cout<<0<<"\n";
	else
		cout<<x<<"\n";
	return 0;
}