A + B is often used as an example of the easiest problem possible to show some contest platform. However, some scientists have observed that sometimes this problem is not so easy to get accepted. Want to try?

Input

The input contains two integers a and b (0 ≤ a, b ≤ 103), separated by a single space.

Output

Output the sum of the given integers.

Examples

Input

5 14


Output

19


Input

381 492


Output

873
#include <bits/stdc++.h>
inline int read() {
  register char c = getchar();
  register int d = 0;
  while (!isdigit(c)) c = getchar();
  while (isdigit(c)) d = (d << 3) + (d << 1) + (c ^ 48), c = getchar();
  return d;
}
inline void write(int x) {
  if (x > 9) write(x / 10);
  putchar(x % 10 + '0');
}
const int n = 2;
int tree[n << 2];
inline void update(const int &p, const int &k) {
  for (register int i = p; i <= n; tree[i] += k, i += i & (-i))
    ;
}
inline int query(const int &p) {
  register int ans = 0;
  for (register int i = p; i > 0; ans += tree[i], i &= i - 1)
    ;
  return ans;
}
int main(int argc, const char *argv[]) {
  for (register int i = 1; i <= n; ++i) {
    const int x = read();
    update(i, x);
  }
  write(query(n));
  putchar('\n');
  return 0;
}
