LDFN - IGGI

http://appinventor.mit.edu/explore/master-trainers.html#nguyen

This app is created using MIT App Inventor to demonstrate its ability in CS courses, especially Algorithms.
Problem Introduction

Problem Introduction: The Fibonacci numbers are defined as follows: F0 = 0, F1 = 1, and Fi = Fi−1 + Fi−2 for i ≥ 2.

Problem Description:
Task. Given an integer n, find the last digit of the nth Fibonacci number Fn (that is, Fn mod 10).
Input Format. The input consists of a single integer n.
Constraints. 0 ≤ n ≤ 10^7

Output Format. Output the last digit of Fn.