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

#define llong long long 
#define len(x) ((int)x.size())
#define rep(i,n) for (int i = -1; ++ i < n; )
#define rep1(i,n) for (int i = 0; i ++ < n; )
#define rand __rand
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());  // or mt19937_64
template<class T = int> T rand(T range = numeric_limits<T>::max()) { return (T)(rng() % range); }

#define CONCAT_(x, y) x##y/*{{{*/
#define CONCAT(x, y) CONCAT_(x, y)
#ifdef LOCAL_DEBUG   
int __db_level = 0;
bool __db_same_line = false;
#define clog cerr << string(!__db_same_line ? __db_level * 2 : 0, ' ')
struct debug_block {
    function<void()> fn;
    void print_name() { __db_same_line = true; fn(); clog << endl; __db_same_line = false;  }
    debug_block(function<void()> fn_): fn(fn_) { clog << "{ "; print_name(); ++__db_level; }
    ~debug_block() { --__db_level; clog << "} "; print_name(); }
};
#define DB(args...) debug_block CONCAT(dbbl, __LINE__)([=]{ clog << args; })
#define deb(...)  if (1) { (clog << "[" #__VA_ARGS__ "] = [" << __VA_ARGS__) << "]"; if (!__db_same_line) clog << endl; }
#else
#define clog if (0) cerr
#define DB(...)
#define deb(...)
#endif
template<class T>
ostream& operator,(ostream& out, const T& thing) { return out << ", " << thing; }
template<class U, class V>
ostream& operator<<(ostream& out, const pair<U, V>& p) { return (out << "(" << p.first, p.second) << ")"; }
template<class A, class B>
ostream& operator<<(ostream& out, const tuple<A, B>& t) { return (out << "(" << get<0>(t), get<1>(t)) << ")"; }
template<class A, class B, class C>
ostream& operator<<(ostream& out, const tuple<A, B, C>& t) { return (out << "(" << get<0>(t), get<1>(t), get<2>(t)) << ")"; }
template<class T> ostream& operator<<(ostream& out, const vector<T>& container) { 
    out << "{";
    if (len(container)) out << container[0];
    rep1(i, len(container) - 1) out, container[i];
    return out << "}";
}
template<class x> vector<typename x::value_type> $v(const x& a) { return vector<typename x::value_type>(a.begin(), a.end()); }
#define ptrtype(x) typename iterator_traits<x>::value_type
template<class u> vector<ptrtype(u)> $v(u a, u b) { return vector<ptrtype(u)>(a, b); }/*}}}*/
// ACTUAL SOLUTION BELOW ////////////////////////////////////////////////////////////

const llong rem = (llong)(1e9 + 7);
vector<llong> mul_po(vector<llong> u, vector<llong> v, int ans_len) {
    vector<llong> ans (ans_len);
    rep(i, len(u)) rep(f, len(v)) {
        if (i + f >= ans_len) break;
        (ans[i + f] += u[i] * v[f]) %= rem;
    }
    return ans;
}


vector<llong> mpow(vector<llong> base, int exp) {
    vector<llong> ans(1, 1);
    int cap_len = len(base);
    
    for (; exp > 0; exp >>= 1) {
        deb(exp);
        if (exp & 1) {
            ans = mul_po(ans, base, cap_len);
        }
        base = mul_po(base, base, cap_len);
        // deb(ans, base); 
    }
    return ans;
}

const int maxn = 5050;
int n;
string s;

llong way[2][2][maxn];

int main(void) {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    
    cin >> n >> s;
    
    int addition = n - len(s);
    vector<llong> first_dp(1, 1), coef(1, 1);
    rep(strict, 2) {
        way[strict][0][0] = 1;
        rep1(consumed, addition) {
                int state = consumed & 1;
            rep(sum, maxn - 1) {
                way[strict][state][sum] = way[strict][!state][sum + 1];
                if (sum == 0) {
                    if (!strict)
                        (way[strict][state][sum] += way[strict][!state][sum]) %= rem;
                } else {
                    (way[strict][state][sum] += 2 * way[strict][!state][sum - 1]) %= rem;
                }
            }
            (strict ? coef : first_dp).push_back(way[strict][state][0]);
        }
    }
    coef = mpow(coef, len(s));
    auto ans = mul_po(first_dp, coef, addition + 1);
    // deb(ans); 
    cout << ans[addition];
    

    return 0;
}

// Remember:
// - Multitest? REFRESHING the data!!!
// - Constrains for each set of data may differs. Should NOT USE the same max constant (maxn)
//   for all of them.
// vim: foldmethod=marker


Measured memory_bytes: 3944