Hello I have a question about; Java Tribonacci (where each term is the sum of the three preceding terms.) sequence using recursion,

Tribonacci sequence where Fn = F(n-1) + F(n-2) + F(n-3) and the first three terms of the sequence are F(0)=0, F(1)=0, and F(2)=1.

Given an input number n, find the nth term of the Tribonacci sequence.

Input data will be take-in through scanner

Sample input data:

3

Sample output data:

1