#include <stdio.h>
int fibonacci_Number(int n){
    //  フィボナッチ数を求める関数
    //  Fn = Fn-1 + Fn-2
    int i;      //  subscript
    int f[2] = {0,1};
    int next;   //  Fn+1
    for(i = 3; i <= n; i++){
        next = f[0] + f[1];
        //  更新
        f[0] = f[1];
        f[1] = next;
    }
    return next;
}
int main(void){
    int N;          //  Fn の n
    long int M;     //  わる数
    long int Fn;    //  fibonacci number
    long int ans;    //  Fn % M
    
    scanf("%d %ld",&N,&M);

    Fn = fibonacci_Number(N - 1) + fibonacci_Number(N - 2);

    //  check ok
    //  printf("Fn = %ld\n",Fn);

    ans = Fn % M;

    //  check ok
    //  printf("ans = %ld\n",ans);
    printf("%ld\n",ans);

    return 0;
}