#define _CRT_SECURE_NO_WARNINGS
#define debug(l) cerr<<#l<<' '<<l<<'\n';
#include "bits/stdc++.h"
using namespace std;
#define all(mask) mask.begin(), mask.end()
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef long double ld;
signed main() {
#ifdef _DEBUG
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    freopen("queen1.in", "r", stdin);
    freopen("queen1.out", "w", stdout);
    int n, m;
    cin >> n >> m;
    vector<vector<int>> a(n,vector<int> (m,-1));
    for (int i = 0; i < n; i++) {
        a[i][0] = 1;
    }
    for (int j = 0; j < m; j++) {
        a[0][j] = 1;
    }
    int l = n - 1, r = m - 1;
    while (r >= 0 && l >= 0) {
        a[l--][r--] = 1;
    }
    a[n - 1][m - 1] = 0;
    vector<int> d(n + m, 1), v(m, 1), g(n, 1);
    d[n + m - 2] = 0, v[m - 1] = 0, g[n - 1] = 0;
    for (int i = 0; i < n; i++) {
        for (int j = m - 1; j >= 0; j--) {
            if (a[i][j] != -1)continue;
            if (d[i + j] == 1 && v[j] == 1 && g[i] == 1) {
                d[i + j] = 0, v[j] = 0, g[i] = 0;
                a[i][j] = 0;
            }
            else {
                a[i][j] = 1;
            }
        }
    }
    if (a[n - 1][0] == 1) {
        cout << 1;
    }
    else {
        cout << 2;
    }

}