A **Padovan Sequence** is a sequence which is represented by the following recurrence

P(n) = P(n-2) + P(n-3)

P(0) = P(1) = P(2) = 1

Now given a number N your task is to find the Nth no in this sequence.

**Note:** Since the output could be very long take mod 1000000007

**Input:**

The first line of input contains an integer T denoting the no of test cases. Then T test cases follow. Each line contains an integer N.

**Output:**

For each test case in a new line print the nth no of the Padovan sequence.

**Constraints:**

1<=T<=100

1<=N<=100

**Example:
Input:**

2

12

4

21

2

kasha01 | 8 |

pimcub2011 | 8 |

Chris Hawkes | 5 |

slim1972 | 4 |

saxenautkarsh | 4 |

N NAGA SAI KRISHNA | 757 |

whomi | 628 |

Anshu Ahirwar | 598 |

gau7av | 501 |

gameghost07 | 488 |

akhayrutdinov | 3456 |

sanjay05 | 3327 |

Jasleen Kaur 2 | 2012 |

Michael Riegger | 1821 |

Quandray | 1817 |