#include<cstdio>
#include<iostream>
#include<vector>
#include<map>
#include<stack>
#include<queue>
#include<bitset>
#include<list>
#include<iomanip>
#include<string>
#include<climits>
#include <sstream>
#include <fstream>
#include<cctype>
#include<time.h>
#include<assert.h>
#include <numeric>
#include <functional>
#include<cstring>
#include<cmath>
#include<iterator>
#include <memory.h>
#include<utility>
#include <ctime>
#include<algorithm>
#define all(v) v.begin(),v.end()
#define read(input) freopen("input.txt","r",stdin)
#define write(output) freopen("output.txt","w",stdout)
#define min3(a,b,c) min(a,min(b,c))
#define max3(a,b,c) max(a,max(b,c))
#define min4(a,b,c,d) min(min(a,b),min(c,d))
#define max4(a,b,c,d) max(max(a,b),max(c,d))
#define maxall(v) *max_element(v.begin(),v.end())
#define minall(v) *min_element(v.begin(),v.end())
#define pb push_back
#define mk make_pair
#define SORT(v) sort(v.begin(),v.end())
#define UN(v) SORT(v), (v).earse(unique(v.begin(),v.end()),v.end())
#define FILL(a,d) memset(a,d,sizeof(a))
#define ll long long
#define PI 2*acos(0.0)
#define pi pair<int,int>
using namespace std;
const int inf=1000000007;
int main()
{
    int i,j,k,n,d;
    vector<int>v;
    while(cin>>n)
    {
        for(i=0;i<n;i++)
            {
                cin>>d;
                v.pb(d);
            }
            SORT(v);
            if(binary_search(all(v),3)==true)
                cout<<"FOUND"<<endl;
            else
                cout<<"NOT FOUND"<<endl;
            v.clear();
    }
    return 0;
}