$1$ Consistent data

A sequence containing only $0s$ and $1s$ is called a consistent sequence if no adjacent values in the sequence are the same. For example $(010101$dots$)$ is a consistent sequence while $(011)$ is not. You are allotted a simple task.

Given an integer $N$ that represents the size of a consistent sequence starting with $\text{'}0\text{'}.$

Fine out the number of consistent subsequences of the given sequence mod ${10}^9+7.$

Note: A subsequence is a sequence that can be derived from the given sequence by deleting zero or more elements without changing the order of the remaining elements.

Function description

Complete the function Consistent$().$ This function takes the following parameter and returns the required answer:

$N$ : Represents the size of the sequence

Input format for custom testing

Note: Use this input format if you are testing against custom input or writing code in a language where we don't provide boilerplate code

The first line contains an integer $N$ representing the sequence's size. Output format

Print the number of consistent subsequences mod ${10}^9+7.$

Constraints

$1N{10}^6$