find total ways to get sum n

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int value;
    cin>>value;
    long long ways[value+6]={0};
    ways[0]=1;
    ways[1]=1;
    ways[2]=2;
    ways[3]=4;
    ways[4]=8;
    ways[5]=16;
    ways[6]=32;
    long int mod=pow(10,9)+7;
    for(int i=7;i<=value;i++)
    {
        ways[i]=ways[i-1]+ways[i-2]+ways[i-3]+ways[i-4]+ways[i-5]+ways[i-6];
        ways[i]%=mod;
    }
    cout<< ways[value];
}