京东漂亮串代码//不知道可不可以过，大概率今晚脑壳被门夹了#include<iostream>using namespace std;long long result=0;void dfs(int target,int cnt,int tmp){    if(target<0)return;    if(target==0){        if(cnt>=2){            long long N=1e9+7;            result=(result+tmp)%(N);        }        //cout<<result<<" ";        return;            }        dfs(target-3,cnt+1,tmp);    dfs(target-1,cnt,tmp*26);    }int main(){    int num;    cin>>num;    dfs(num,0,1);    cout<<result;        return 0;}