/*
TASK: fib
LANG: C++
*/
#include<iostream>
using namespace std;
int main ()
{
    long int m;
    long long int n;
    cin>>n>>m;
    if ((n==1) || (n==2)) {cout<<1; return 0;}
    long long int t=3;
    long int a1=1;
    long int a2=1;
    long int swap;
    while (t<=n)
    {
          swap=a2;
          a2=(a1+a2)%m;
          a1=swap;
          t++;
    }
    cout<<a2;    
    
    return 0;
}
