#include <bits/stdc++.h>
using namespace std;
long long int dx[] = {1, -1, 0, 0};
long long int dy[] = {0, 0, -1, 1};
long long int gcd(long long int a, long long int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long int power_mod(long long int a, long long int n) {
  long long int res = 1;
  while (n > 0) {
    if (n & 1)
      res = ((res % 1000000007) * (a % 1000000007)) % 1000000007, n--;
    else
      a = ((a % 1000000007) * (a % 1000000007)) % 1000000007, n /= 2;
  }
  return res;
}
long long int nCr(long long int n, long long int r) {
  if (r > n) return 0;
  double res = 1;
  for (long long int i = 1; i <= r; i++) res = (res * (n - r + i)) / i;
  return (long long int)(res + 0.01);
}
long long int power(long long int a, long long int n) {
  long long int res = 1;
  for (long long int i = 0; i < n; i++) res = res * a;
  return res;
}
bool cmp(pair<long long int, long long int> a,
         pair<long long int, long long int> b) {
  if (a.first < b.first)
    return true;
  else if (a.first == b.first)
    return a.second > b.second;
  else
    return false;
}
bool is_power_of_two(long long int n) {
  for (long long int i = 0; i < 32; i++) {
    if ((1 << i) == n) return true;
  }
  return false;
}
bool is_ok(long long int c, long long int dp1[], long long int dp2[],
           long long int s1, long long int s2, long long int m) {
  for (long long int i = 0; i <= c; i++) {
    long long int x = i, y = (c - i) / 2;
    if (x > s1) x = s1;
    if (y > s2) y = s2;
    long long int cnt = 0;
    if (x != 0) cnt += dp1[x - 1];
    if (y != 0) cnt += dp2[y - 1];
    if (cnt >= m) return true;
  }
  return false;
}
long long int dp[1000000];
void init() {
  dp[0] = 1;
  dp[1] = 1;
  for (long long int i = 2; i < 1000000; i++) dp[i] = dp[i - 1] + dp[i - 2];
}
void solve() {
  init();
  long long int n, m;
  cin >> n >> m;
  cout << 2 * dp[n] + 2 * dp[m] - 2 << endl;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long int t = 1;
  while (t--) {
    solve();
  }
}
