The Fibonacci sequence is a series of numbers where each number is the sum of the two preceding ones, starting from 0 and 1. Your task is to write a function (def getNthFib(n)) that returns the N-th Fibonacci number efficiently.