#include <bits/stdc++.h>
#define DEBUG fprintf(stderr, "Passing [%s] line %d\n", __FUNCTION__, __LINE__)
#define File(x) freopen(x".in","r",stdin); freopen(x".out","w",stdout)
#define int long long

using namespace std;

typedef long long LL;
typedef pair <int, int> PII;
typedef pair <int, PII> PIII;

template <typename T>
inline T gi()
{
	T f = 1, x = 0; char c = getchar();
	while (c < '0' || c > '9') {if (c == '-') f = -1; c = getchar();}
	while (c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
	return f * x;
}

const int INF = 0x3f3f3f3f, N = 300013, M = N << 1;

int n, w;

namespace BIT
{
	int tr[N];
	int lowbit(int i) {return i & (-i);}
	void add(int u, int val)
	{
		++u;
		for (int i = u; i <= 300001; i += lowbit(i)) tr[i] += val;
	}
	int query(int u)
	{
		int res = 0;
		++u;
		for (int i = u; i; i -= lowbit(i)) res += tr[i];
		return res;
	}
} //namespace BIT

signed main()
{
	//File("");
    n = gi <int> ();
  cout << max(0ll, n) << endl;
	return 0;
}

#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <math.h>
#include <cassert>
#define rep(i,n) for(int i = 0; i < n; ++i )
using namespace std;
using ll = long long;

int main() {
  int n,k;
  cin >> n >> k;
  int x = 0;
  rep(i,n)rep(j,k) x += (i+1)*100+j+1;
  cout << x << endl;
}
