#include #define rep(i, n) for (int i = 0; i < (n); ++i) #define sz(x) int(x.size()) using namespace std; typedef long long ll; typedef pair P; const ll INF = 1LL << 60; ll N, M; ll dp[5000010]; int main() { cin >> N >> M; dp[0] = 0; dp[1] = 1; for (int i = 2; i <= N - 1; i++) { dp[i] = dp[i - 1] + dp[i - 2]; dp[i] %= M; } cout << dp[N - 1] << endl; }