#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <map>
#include <string>
using namespace std;
long long int case1[1000000] = {0};
long long int case2[1000000] = {0};
long long int case3[1000000] = {0};


long long int countKenpa(long long int n, long long int ikkomae,long long int jibun){
	if( n == 0){
		return 0;
	}else if( n == 1){
		return 1;
	}
	if(jibun == 2){
		if(case1[n] != 0){
			return case1[n];
		}
		case1[n] = countKenpa(n-1,jibun,1);
		return case1[n];
	}else if(jibun == 1){
		if(ikkomae == 1){
			if(case2[n] != 0){
				return case2[n];
			}
			case2[n] = countKenpa(n-1,jibun,2);
			return case2[n];
		}else if(ikkomae == 2){
			if(case3[n] != 0){
				return case3[n];
			}
			case3[n] = countKenpa(n-1,jibun,1) + countKenpa(n-1,jibun,2);
			return case3[n];
		}
	}
}

int main()
{
	long long int n;
	cin>>n;
	cout<< countKenpa(n,2,1) % (1000000000 + 7)<<endl;
    return 0;
}