#include <bits/stdc++.h>

namespace nono {

std::vector<std::pair<int, int>> factorize(int n) {
    std::vector<std::pair<int, int>> result;
    for (long long i = 2; i * i <= n; i++) {
        int count = 0;
        while (n % i == 0) {
            n /= i;
            count++;
        }
        if (count > 0) {
            result.emplace_back(i, count);
        }
    }
    if (n != 1) {
        result.emplace_back(n, 1);
    }
    return result;
}

void solve() {
    int l, r;
    std::cin >> l >> r;
    std::cout << 1 << std::endl;
}

}  //  namespace nono

int main() {
    std::cin.tie(0)->sync_with_stdio(0);
    std::cout << std::fixed << std::setprecision(15);

    int t = 1;
    //  std::cin >> t;
    while (t--) nono::solve();
}