#include <iostream> #include <vector> using namespace std; long long countBinaryNumbers(int n, long long s, long long t) { vector<vector<long long>> dp(n + 1, vector<long long>(2, 0)); dp[0][0] = 1; for (int i = 1; i <= n; i++) { dp[i][0] = dp[i - 1][0] + dp[i - 1][1]; dp[i][1] = dp[i - 1][0]; } long long count = 0; for (int i = n; i >= 0; i--) { if ((s >> i) & 1) { count += dp[i][1]; if ((t >> i) & 1) { break; } } else if ((t >> i) & 1) { count += dp[i][0]; } } return count; } int main() { int n; long long s, t; cin >> n >> s >> t; long long result = countBinaryNumbers(n, s, t); cout << result << endl; return 0; }