<BIT> TEMPLATE

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define mp make_pair
#define pb push_back
#define pii pair <int, int>
#define vi vector<int>

#define read1(a) int a; scanf("%d", &a)
#define read2(a, b) int a, b; scanf("%d %d", &a, &b)
#define read3(a, b, c) int a, b, c; scanf("%d %d %d", &a, &b, &c)

#define FOR(i, a, b) for (int i=a; i<b; i++)
#define F0R(i, a) for (int i=0; i<a; i++)

#define readgi(n) F0R(i, n) { scanf("%d", &arr[i]); }
#define readgs(n) F0R(i, n) { scanf(" %c", &arr[i]); }

#define f first
#define s second

const int MOD = 1000000007;
const int MAX = 100005;

int arr[MAX];
ll tree[MAX];
void upd(int idx, ll val) {
    while (idx < MAX - 1) {
        tree[idx] = (tree[idx] + val) % MOD;
        idx += (idx & -idx);
    }
}

ll get(int idx) {
    ll ans = 0;
    while (idx > 0) {
        ans = (ans + tree[idx]) % MOD;
        idx -= (idx & -idx);
    }
    return ans;
}

int main() {
    upd(2, 1);
    upd(6, 4);
    upd(7, 2);
    cout << get(7) << endl;
    /* 7 */
}