**Compilation/Execution Result:**

Count number of binary strings without consecutive 1’s

**Problem Description:**

Given a positive integer N, count all possible distinct binary strings of length N such that there are no consecutive 1’s. **Output your answer mod 10^9 + 7.**

**Input:**

The first line of input contains an integer T denoting the number of test cases. The description of T test cases follows.

Each test case contain an integer N representing length of the binary string.

**Output:**

Print the count number of binary strings without consecutive 1’s of length N.

**Constraints:**

1 ≤ T ≤ 100

1 ≤ N ≤ 100

**Example:**

Input:

2

3

2

Output:

5

3

**Explaination:**

For first test case 5 strings are (000, 001, 010, 100, 101)

For second test case 3 strings are (00,01,10)

Author: abhiraj26

SANJAY5797 | 143 |

Himanshusinghchauhan | 117 |

iharshitmittal | 106 |

Lam Ngoc Pham | 105 |

dauntless | 100 |

Shashank_Pathak | 652 |

dark_knights | 560 |

surbhi_7 | 556 |

SANJAY5797 | 451 |

Vasudha Gupta | 377 |

akhayrutdinov | 4161 |

sanjay05 | 3633 |

Quandray | 2833 |

Ibrahim Nash | 2524 |

Michael Riegger | 2306 |