#include <iostream>
#include <vector>
#include <algorithm>

int main() {
    int a, b;
    std::cin >> a >> b;

    std::vector<int> xs(a + b, 1);
    for (int i = 0; i < a; ++i) xs[i] = 0;

    int ans = 0;
    do {
        int cnt = 0;
        for (int i = 1; i < a + b; ++i) {
            if (xs[i] != xs[i - 1]) ++cnt;
        }
        ans = std::max(ans, cnt);
    } while (std::next_permutation(xs.begin(), xs.end()));

    std::cout << ans << std::endl;
    return 0;
}