def dp(n):
    """Returns the n-th number of fib with DP"""
    f = [0] * (n + 1)
    for i in range(n + 1):
        if i <= 1:
            f[i] = i
        else:
            f[i] = f[i - 1] + f[i - 2]
    return f[n]