#include using namespace std; typedef long long int64; int64 N, M; int64 dp[5000001]; int64 f(int k) { if(k <= 2) return (k - 1); if(~dp[k]) return (dp[k]); return (dp[k] = (f(k - 1) + f(k - 2)) % M); } int main() { cin >> N >> M; memset(dp, -1, sizeof(dp)); for(int i = 2; i <= 5000000; i++) f(i); cout << f(N) << endl; }