#include using namespace std; using ll = long long; using ld = long double; using ull = unsigned long long; template using max_heap = priority_queue; template using min_heap = priority_queue, greater>; #define rep(i, l, r) for (ll i = (l); i < (r); i++) #define rrep(i, r, l) for (ll i = (r); i-- > (l);) #define all(x) begin(x), end(x) template bool chmin(T& lhs, T rhs) { return lhs > rhs ? (lhs = rhs, true) : false; } template bool chmax(T& lhs, T rhs) { return lhs < rhs ? (lhs = rhs, true) : false; } struct IOIO { IOIO() { cin.tie(0)->sync_with_stdio(0); } } ioio; template ostream& operator<<(ostream& os, const pair& p) { os << '(' << p.first << ", " << p.second << ')'; return os; } template ostream& operator<<(ostream& os, const vector& vs) { os << '{'; rep(i, 0, (int)vs.size()) os << vs[i] << (i + 1 == (int)vs.size() ? "" : ", "); os << '}'; return os; } template ostream& operator<<(ostream& os, const set& vs) { os << '{'; for (auto it = vs.begin(); it != vs.end(); it++) { if (it != vs.begin()) { os << ", "; } os << *it; } os << '}'; return os; } template ostream& operator<<(ostream& os, const map& vs) { os << '{'; for (auto it = vs.begin(); it != vs.end(); it++) { if (it != vs.begin()) { os << ", "; } os << *it; } os << '}'; return os; } #ifdef DEBUG void dump_func() { cerr << endl; } template void dump_func(Head&& head, Tail&&... tail) { cerr << head; if (sizeof...(Tail) > 0) { cerr << ", "; } dump_func(std::move(tail)...); } #define dump(...) cerr << "[" + string(#__VA_ARGS__) + "] ", dump_func(__VA_ARGS__) #else #define dump(...) static_cast(0) #endif int main() { int n; cin >> n; string s; cin >> s; rep(i, 0, ssize(s) - 2) { if (s[i] == '4' && s[i + 1] == '0' && s[i + 2] == '4') { cout << "Found" << '\n'; return 0; } } cout << "NotFound" << '\n'; }