Programmers 피보나치 수

def solution(n):
    return fibo(n) % 1234567


def fibo(n):
    curr, next = 0, 1
    for _ in range(n):
        curr, next = next, curr + next
    return curr

class Solution {
    public int solution(int n) {
        return fibo(n);
    }

    public int fibo(int n) {
        int curr = 0;
        int next = 1;
        for (int i = 0; i < n; i++) {
            int temp = curr;
            curr = next;
            next = (temp + next) % 1234567;
        }

        return curr;
    }
}