n, m = gets.chomp.split.map(&:to_i)

def fib(n)
    case n
    when 1
        return 0
    when 2
        return 1
    else
        return fib(n - 1) + fib(n - 2)
    end
end

p fib(n) % m