#include<bits/stdc++.h>
#define r_0 return 0
#define pb push_back
#define ll long long
#define fr first
#define se second

using namespace std;

const int N = 1e3;
map<char ,int >mp,m1;
int used[N][N];
int use[100000];
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
      cout.tie(0);

          /// freopen( "input.txt", "r", stdin );
            /// freopen( "output.txt", "w", stdout );

     ll n;
     ll m,x,cnt = 0,y;
    cin >> n >> m;
    for( int i = 1; i <= m; i ++ )
    {
        cin >> x;
        cnt += x % 2;
    }
    if ( n == 2 and m == 2 )
       return cout << "even\n",0;
    if( cnt % 2 == 0 )
        cout << "even\n";
    else
        cout << "odd\n";

}


///                         .
///                     /   ))     |\         )               ).
///               c++. (\  ( `.    / )  (\   ( `.     ).     ( (
///               | |   ))  ) )   ( (   `.`.  ) )    ( (      ) )
///               | |  ( ( / _..----.._  ) | ( ( _..----.._  ( (
/// ,-.           | |---) V.'-------.. `-. )-/.-' ..------ `--) \._
/// | /===========| |  (   |      ) ( ``-.`\/'.-''           (   ) ``-._
/// | | / / / / / | |--------------------->  <-------------------------_>=-
/// | \===========| |                 ..-'./\.`-..                _,,-'
/// `-'           | |-------._------''_.-'----`-._``------_.-----'
///               | |         ``----''            ``----''
///               | |
///               c++`

///██╗ ██████╗ ██╗    ██████╗  ██████╗  ██████╗   ██████╗
///██║██╔═══██╗██║    ╚════██╗██╔═████╗ ╚════██╗ ██╔═████╗
///██║██║   ██║██║     █████╔╝██║██╔██║  █████╔╝ ██║██╔██║
///██║██║   ██║██║    ██╔═══╝ ████╔╝██║ ██╔═══╝  ████╔╝██║
///██║╚██████╔╝██║    ███████╗╚██████╔╝ ███████╗ ╚██████╔╝
///╚═╝ ╚═════╝ ╚═╝    ╚══════╝ ╚═════╝  ╚══════╝  ╚═════╝

#include<bits/stdc++.h>
#include<fstream>
///#include "windows.h"
#define ll long long
#define ld long double
#define pb push_back
#define pf push_front
#define fr first
#define sc second
#define mlojins cout.tie(NULL);
#define bzbz cin.tie(NULL);
#define CODER ios_base::sync_with_stdio(0)  ;
#define p_b pop_back
#define p_f pop_front
#define Qulukh
#define quluq return 0;
#define Zohiri_dzd
#define Mekh
#define Black_star

using namespace std ;

const ll N = 1e6 + 1;

map <ll , ll> mp , pm ;
map <ll , ll> hs ;
deque <ll> v , vc , ve ,vv , vd ;
deque <char> p , pe ;
deque <string> ts , ss , st ;
deque <double> sd , ds ;
ll a , b , c , d , e , f , cnt , ans , r , n , l , x , y ;
ld q , t , cnt1 , cnt2 ;
string g , h , w , o , m , s ;
char z , u ;
bool re , rt ;
vector<pair < ll , ll > > pr , rp , pp ;
map < pair < char , char > , ll > aw , wa ;
int main ()
{
    bzbz
    mlojins
    Qulukh
    Mekh
    CODER
    Zohiri_dzd
    Black_star
    ///freopen("input.txt" , "r" , stdin );
    ///freopen("output.txt", "w" , stdout );
    ///Author of the greatest code :: Murtazoev Alijon
    cin >> a >> b ;
    ans = b ;
    for (ll i = 0 ; i < b ; i ++ )
    {
        ans -- ;
        cin >> c ;
        n = a % 10 ;
        n = pow(n , ans) ;
        if ((n * c) % 2 != 0)
            x ++ ;
        else
            y ++ ;
    }
    if (x % 2 == 0)
    {
        cout << "even" ;
        return 0;
    }
    cout << "odd" ;
}
///Mmavl studios
///Eco students


///                         .
///                     /   ))     |\         )               ).
///               c++. (\  ( `.    / )  (\   ( `.     ).     ( (
///               | |   ))  ) )   ( (   `.`.  ) )    ( (      ) )
///               | |  ( ( / _..----.._  ) | ( ( _..----.._  ( (
/// ,-.           | |---) V.'-------.. `-. )-/.-' ..------ `--) \._
/// | /===========| |  (   |      ) ( ``-.`\/'.-''           (   ) ``-._
/// | | / / / / / | |--------------------->  <-------------------------_>=-
/// | \===========| |                 ..-'./\.`-..                _,,-'
/// `-'           | |-------._------''_.-'----`-._``------_.-----'
///               | |         ``----''            ``----''
///               | |
///               c++`

///██╗ ██████╗ ██╗    ██████╗  ██████╗  ██████╗   ██████╗
///██║██╔═══██╗██║    ╚════██╗██╔═████╗ ╚════██╗ ██╔═████╗
///██║██║   ██║██║     █████╔╝██║██╔██║  █████╔╝ ██║██╔██║
///██║██║   ██║██║    ██╔═══╝ ████╔╝██║ ██╔═══╝  ████╔╝██║
///██║╚██████╔╝██║    ███████╗╚██████╔╝ ███████╗ ╚██████╔╝
///╚═╝ ╚═════╝ ╚═╝    ╚══════╝ ╚═════╝  ╚══════╝  ╚═════╝

#include<bits/stdc++.h>
#include<fstream>
#define ll long long
#define ld long double
#define pb push_back
#define pf push_front
#define fr first
#define sc second
#define mlojins cout.tie(NULL);
#define bzbz cin.tie(NULL);
#define CODER ios_base::sync_with_stdio(0)  ;
#define p_b pop_back
#define p_f pop_front
#define Qulukh
#define quluq return 0;
#define Zohiri_dzd
#define Mekh
#define Black_star
using namespace std ;

const ll N = 1e6 + 1;

map <char , ll> mp , pm ;
deque <ll> v , vc , ve ,vv , vd ;
deque <char> p , pe ;
deque <string> ts , ss , st ;
deque <double> sd , ds ;
ll a , b , c , d , e , f , cnt , ans , r , n , l , x , y ;
ld q , t , cnt1 , cnt2 ;
string g , h , w , o , m , s ;
char z , u ;
bool re , rt ;
vector<pair < ll , ll > > pr , rp , pp ;
map < pair < char , char > , ll > aw , wa ;
int main ()
{
    bzbz
    mlojins
    Qulukh
    Mekh
    CODER
    Zohiri_dzd
    Black_star
    ///freopen("input.txt" , "r" , stdin );
    ///freopen("output.txt", "w" , stdout );
    ///Author :: Murtazoev Alijon
    cin >> a >> b ;
    d = b ;
    d -- ;
    a %= 10 ;
    for (ll i = 0 ; i < b ; i ++ )
    {
        cin >> c ;
        ans = 1 ;
        ans = pow(a , d) ;
        c %= 10 ;
        ans %= 10 ;
        ans *= c ;
        n += ans % 10 ;
        d -- ;
    }
    if (n % 2 == 0)
        cout << "even" << endl;
    else
        cout << "odd" << endl;
}
///Mmavl studios
///Eco students


///                         .
///                     /   ))     |\         )               ).
///               c++. (\  ( `.    / )  (\   ( `.     ).     ( (
///               | |   ))  ) )   ( (   `.`.  ) )    ( (      ) )
///               | |  ( ( / _..----.._  ) | ( ( _..----.._  ( (
/// ,-.           | |---) V.'-------.. `-. )-/.-' ..------ `--) \._
/// | /===========| |  (   |      ) ( ``-.`\/'.-''           (   ) ``-._
/// | | / / / / / | |--------------------->  <-------------------------_>=-
/// | \===========| |                 ..-'./\.`-..                _,,-'
/// `-'           | |-------._------''_.-'----`-._``------_.-----'
///               | |         ``----''            ``----''
///               | |
///               c++`

///██╗ ██████╗ ██╗    ██████╗  ██████╗  ██████╗   ██████╗
///██║██╔═══██╗██║    ╚════██╗██╔═████╗ ╚════██╗ ██╔═████╗
///██║██║   ██║██║     █████╔╝██║██╔██║  █████╔╝ ██║██╔██║
///██║██║   ██║██║    ██╔═══╝ ████╔╝██║ ██╔═══╝  ████╔╝██║
///██║╚██████╔╝██║    ███████╗╚██████╔╝ ███████╗ ╚██████╔╝
///╚═╝ ╚═════╝ ╚═╝    ╚══════╝ ╚═════╝  ╚══════╝  ╚═════╝

#include<bits/stdc++.h>
#include<fstream>
#define ll long long
#define ld long double
#define pb push_back
#define pf push_front
#define fr first
#define sc second
#define mlojins cout.tie(NULL);
#define bzbz cin.tie(NULL);
#define CODER ios_base::sync_with_stdio(0)  ;
#define p_b pop_back
#define p_f pop_front
#define Qulukh
#define quluq return 0;
#define Zohiri_dzd
#define Mekh
#define Black_star
using namespace std ;

const ll N = 1e6 + 1;

map <char , ll> mp , pm ;
deque <ll> v , vc , ve ,vv , vd ;
deque <char> p , pe ;
deque <string> ts , ss , st ;
deque <double> sd , ds ;
ll a , b , c , d , e , f , cnt , ans , r , n , l , x , y ;
ld q , t , cnt1 , cnt2 ;
string g , h , w , o , m , s ;
char z , u ;
bool re , rt ;
vector<pair < ll , ll > > pr , rp , pp ;
map < pair < char , char > , ll > aw , wa ;
int main ()
{
    bzbz
    mlojins
    Qulukh
    Mekh
    CODER
    Zohiri_dzd
    Black_star
    ///freopen("input.txt" , "r" , stdin );
    ///freopen("output.txt", "w" , stdout );
    ///Author :: Murtazoev Alijon
    /*cin >> a >> b ;
    d = b ;
    d -- ;
    cnt = a ;
    for (ll i = 0 ; i < b ; i ++ )
    {
        cin >> c ;
        ans = powf(a , d) ;
        c %= 10 ;
        ans %= 10 ;
        ans *= c ;
        n += ans % 10 ;
        d -- ;
        v.pb(c) ;
    }
    if (v.size() == b and b == 0 and cnt == a)
    {
        cout << "odd" ;
        quluq
    }
    if (n % 2 == 0)
        cout << "even" << endl;
    else
        cout << "odd" << endl;*/
    cin >> a >> b ;
    d = b ;
    d -- ;
    a %= 10 ;
    for (ll i = 0 ; i < b ; i ++ )
    {
        cin >> c ;
        ans = 1 ;
        ans = pow(a , d) ;
        c %= 10 ;
        ans %= 10 ;
        ans *= c ;
        n += ans % 10 ;
        n %= 10 ;
        d -- ;
    }
    if (n % 2 == 0)
        cout << "even" << endl;
    else
        cout << "odd" << endl;
}
///Mmavl studios
///Eco students


///                         .
///                     /   ))     |\         )               ).
///               c++. (\  ( `.    / )  (\   ( `.     ).     ( (
///               | |   ))  ) )   ( (   `.`.  ) )    ( (      ) )
///               | |  ( ( / _..----.._  ) | ( ( _..----.._  ( (
/// ,-.           | |---) V.'-------.. `-. )-/.-' ..------ `--) \._
/// | /===========| |  (   |      ) ( ``-.`\/'.-''           (   ) ``-._
/// | | / / / / / | |--------------------->  <-------------------------_>=-
/// | \===========| |                 ..-'./\.`-..                _,,-'
/// `-'           | |-------._------''_.-'----`-._``------_.-----'
///               | |         ``----''            ``----''
///               | |
///               c++`

///██╗ ██████╗ ██╗    ██████╗  ██████╗  ██████╗   ██████╗
///██║██╔═══██╗██║    ╚════██╗██╔═████╗ ╚════██╗ ██╔═████╗
///██║██║   ██║██║     █████╔╝██║██╔██║  █████╔╝ ██║██╔██║
///██║██║   ██║██║    ██╔═══╝ ████╔╝██║ ██╔═══╝  ████╔╝██║
///██║╚██████╔╝██║    ███████╗╚██████╔╝ ███████╗ ╚██████╔╝
///╚═╝ ╚═════╝ ╚═╝    ╚══════╝ ╚═════╝  ╚══════╝  ╚═════╝

#include<bits/stdc++.h>
#include<fstream>
///#include "windows.h"
#define ll long long
#define ld long double
#define pb push_back
#define pf push_front
#define fr first
#define sc second
#define mlojins cout.tie(NULL);
#define bzbz cin.tie(NULL);
#define CODER ios_base::sync_with_stdio(0)  ;
#define p_b pop_back
#define p_f pop_front
#define Qulukh
#define quluq return 0;
#define Zohiri_dzd
#define Mekh
#define Black_star

using namespace std ;

const ll N = 1e6 + 1;

map <ll , ll> mp , pm ;
map <ll , ll> hs ;
deque <ll> v , vc , ve ,vv , vd ;
deque <char> p , pe ;
deque <string> ts , ss , st ;
deque <double> sd , ds ;
ll a , b , c , d , e , f , cnt , ans , r , n , l , x , y ;
ld q , t , cnt1 , cnt2 ;
string g , h , w , o , m , s ;
char z , u ;
bool re , rt ;
vector<pair < ll , ll > > pr , rp , pp ;
map < pair < char , char > , ll > aw , wa ;
int main ()
{
    bzbz
    mlojins
    Qulukh
    Mekh
    CODER
    Zohiri_dzd
    Black_star
    ///freopen("input.txt" , "r" , stdin );
    ///freopen("output.txt", "w" , stdout );
    ///Author of the greatest code :: Murtazoev Alijon
    cin >> a >> b ;
    ans = b ;
    for (ll i = 0 ; i < b ; i ++ )
    {
        cin >> c ;
        if (i != b - 1)
        {
            if (a % 2 == 0 or c % 2 == 0)
                x ++ ;
            else
                y ++ ;
        }
        else
        {
            if (c % 2 == 0)
                x ++ ;
            else
                y ++ ;
        }
    }
    if (y % 2 == 0)
        cout << "even" ;
    else
        cout << "odd" ;
}
///Mmavl studios
///Eco students


///                         .
///                     /   ))     |\         )               ).
///               c++. (\  ( `.    / )  (\   ( `.     ).     ( (
///               | |   ))  ) )   ( (   `.`.  ) )    ( (      ) )
///               | |  ( ( / _..----.._  ) | ( ( _..----.._  ( (
/// ,-.           | |---) V.'-------.. `-. )-/.-' ..------ `--) \._
/// | /===========| |  (   |      ) ( ``-.`\/'.-''           (   ) ``-._
/// | | / / / / / | |--------------------->  <-------------------------_>=-
/// | \===========| |                 ..-'./\.`-..                _,,-'
/// `-'           | |-------._------''_.-'----`-._``------_.-----'
///               | |         ``----''            ``----''
///               | |
///               c++`

///██╗ ██████╗ ██╗    ██████╗  ██████╗  ██████╗   ██████╗
///██║██╔═══██╗██║    ╚════██╗██╔═████╗ ╚════██╗ ██╔═████╗
///██║██║   ██║██║     █████╔╝██║██╔██║  █████╔╝ ██║██╔██║
///██║██║   ██║██║    ██╔═══╝ ████╔╝██║ ██╔═══╝  ████╔╝██║
///██║╚██████╔╝██║    ███████╗╚██████╔╝ ███████╗ ╚██████╔╝
///╚═╝ ╚═════╝ ╚═╝    ╚══════╝ ╚═════╝  ╚══════╝  ╚═════╝

#include<bits/stdc++.h>
#include<fstream>
///#include "windows.h"
#define ll long long
#define ld long double
#define pb push_back
#define pf push_front
#define fr first
#define sc second
#define mlojins cout.tie(NULL);
#define bzbz cin.tie(NULL);
#define CODER ios_base::sync_with_stdio(0)  ;
#define p_b pop_back
#define p_f pop_front
#define Qulukh
#define quluq return 0;
#define Zohiri_dzd
#define Mekh
#define Black_star

using namespace std ;

const ll N = 1e6 + 1;

map <ll , ll> mp , pm ;
map <ll , ll> hs ;
deque <ll> v , vc , ve ,vv , vd ;
deque <char> p , pe ;
deque <string> ts , ss , st ;
deque <double> sd , ds ;
ll a , b , c , d , e , f , cnt , ans , r , n , l , x , y ;
ld q , t , cnt1 , cnt2 ;
string g , h , w , o , m , s ;
char z , u ;
bool re , rt ;
vector<pair < ll , ll > > pr , rp , pp ;
map < pair < char , char > , ll > aw , wa ;
int main ()
{
    bzbz
    mlojins
    Qulukh
    Mekh
    CODER
    Zohiri_dzd
    Black_star
    ///freopen("input.txt" , "r" , stdin );
    ///freopen("output.txt", "w" , stdout );
    ///Author of the greatest code :: Murtazoev Alijon
    cin >> a >> b ;
    ans = b ;
    for (ll i = 0 ; i < b ; i ++ )
    {
        ans -- ;
        cin >> c ;
        n = 1 ;
        n = pow(a % 10 , ans) ;
        if ((n * c) % 2 != 0)
            x ++ ;
        else
            y ++ ;
    }
    if (x % 2 == 0)
    {
        cout << "even" ;
        return 0;
    }
    cout << "odd" ;
}
///Mmavl studios
///Eco students


///                         .
///                     /   ))     |\         )               ).
///               c++. (\  ( `.    / )  (\   ( `.     ).     ( (
///               | |   ))  ) )   ( (   `.`.  ) )    ( (      ) )
///               | |  ( ( / _..----.._  ) | ( ( _..----.._  ( (
/// ,-.           | |---) V.'-------.. `-. )-/.-' ..------ `--) \._
/// | /===========| |  (   |      ) ( ``-.`\/'.-''           (   ) ``-._
/// | | / / / / / | |--------------------->  <-------------------------_>=-
/// | \===========| |                 ..-'./\.`-..                _,,-'
/// `-'           | |-------._------''_.-'----`-._``------_.-----'
///               | |         ``----''            ``----''
///               | |
///               c++`

///██╗ ██████╗ ██╗    ██████╗  ██████╗  ██████╗   ██████╗
///██║██╔═══██╗██║    ╚════██╗██╔═████╗ ╚════██╗ ██╔═████╗
///██║██║   ██║██║     █████╔╝██║██╔██║  █████╔╝ ██║██╔██║
///██║██║   ██║██║    ██╔═══╝ ████╔╝██║ ██╔═══╝  ████╔╝██║
///██║╚██████╔╝██║    ███████╗╚██████╔╝ ███████╗ ╚██████╔╝
///╚═╝ ╚═════╝ ╚═╝    ╚══════╝ ╚═════╝  ╚══════╝  ╚═════╝

#include<bits/stdc++.h>
#include<fstream>
#define ll long long
#define ld long double
#define pb push_back
#define pf push_front
#define fr first
#define sc second
#define mlojins cout.tie(NULL);
#define bzbz cin.tie(NULL);
#define CODER ios_base::sync_with_stdio(0)  ;
#define p_b pop_back
#define p_f pop_front
#define Qulukh
#define quluq return 0;
#define Zohiri_dzd
#define Mekh
#define Black_star
using namespace std ;

const ll N = 1e6 + 1;

map <char , ll> mp , pm ;
deque <ll> v , vc , ve ,vv , vd ;
deque <char> p , pe ;
deque <string> ts , ss , st ;
deque <double> sd , ds ;
ll a , b , c , d , e , f , cnt , ans , r , n , l , x , y ;
ld q , t , cnt1 , cnt2 ;
string g , h , w , o , m , s ;
char z , u ;
bool re , rt ;
vector<pair < ll , ll > > pr , rp , pp ;
map < pair < char , char > , ll > aw , wa ;
int main ()
{
    bzbz
    mlojins
    Qulukh
    Mekh
    CODER
    Zohiri_dzd
    Black_star
    ///freopen("input.txt" , "r" , stdin );
    ///freopen("output.txt", "w" , stdout );
    ///Author :: Murtazoev Alijon
    cin >> a >> b ;
    d = b ;
    d -- ;
    a %= 10 ;
    for (ll i = 0 ; i < b ; i ++ )
    {
        cin >> c ;
        ans = 1 ;
        for (ll j = 0 ; j < d ; j ++ )
            ans *= a , ans %= 10 ;
        c %= 10 ;
        ans %= 10 ;
        ans *= c ;
        n += ans % 10 ;
        n %= 10 ;
        d -- ;
    }
    if (n % 2 == 0)
        cout << "even" << endl;
    else
        cout << "odd" << endl;
}
///Mmavl studios
///Eco students


///                         .
///                     /   ))     |\         )               ).
///               c++. (\  ( `.    / )  (\   ( `.     ).     ( (
///               | |   ))  ) )   ( (   `.`.  ) )    ( (      ) )
///               | |  ( ( / _..----.._  ) | ( ( _..----.._  ( (
/// ,-.           | |---) V.'-------.. `-. )-/.-' ..------ `--) \._
/// | /===========| |  (   |      ) ( ``-.`\/'.-''           (   ) ``-._
/// | | / / / / / | |--------------------->  <-------------------------_>=-
/// | \===========| |                 ..-'./\.`-..                _,,-'
/// `-'           | |-------._------''_.-'----`-._``------_.-----'
///               | |         ``----''            ``----''
///               | |
///               c++`

///██╗ ██████╗ ██╗    ██████╗  ██████╗  ██████╗   ██████╗
///██║██╔═══██╗██║    ╚════██╗██╔═████╗ ╚════██╗ ██╔═████╗
///██║██║   ██║██║     █████╔╝██║██╔██║  █████╔╝ ██║██╔██║
///██║██║   ██║██║    ██╔═══╝ ████╔╝██║ ██╔═══╝  ████╔╝██║
///██║╚██████╔╝██║    ███████╗╚██████╔╝ ███████╗ ╚██████╔╝
///╚═╝ ╚═════╝ ╚═╝    ╚══════╝ ╚═════╝  ╚══════╝  ╚═════╝

#include<bits/stdc++.h>
#include<fstream>
///#include "windows.h"
#define ll long long
#define ld long double
#define pb push_back
#define pf push_front
#define fr first
#define sc second
#define mlojins cout.tie(NULL);
#define bzbz cin.tie(NULL);
#define CODER ios_base::sync_with_stdio(0)  ;
#define p_b pop_back
#define p_f pop_front
#define Qulukh
#define quluq return 0;
#define Zohiri_dzd
#define Mekh
#define Black_star

using namespace std ;

const ll N = 1e6 + 1;

map <ll , ll> mp , pm ;
map <ll , ll> hs ;
deque <ll> v , vc , ve ,vv , vd ;
deque <char> p , pe ;
deque <string> ts , ss , st ;
deque <double> sd , ds ;
ll a , b , c , d , e , f , cnt , ans , r , n , l , x , y ;
ld q , t , cnt1 , cnt2 ;
string g , h , w , o , m , s ;
char z , u ;
bool re , rt ;
vector<pair < ll , ll > > pr , rp , pp ;
map < pair < char , char > , ll > aw , wa ;
int main ()
{
    bzbz
    mlojins
    Qulukh
    Mekh
    CODER
    Zohiri_dzd
    Black_star
    ///freopen("input.txt" , "r" , stdin );
    ///freopen("output.txt", "w" , stdout );
    ///Author of the greatest code :: Murtazoev Alijon
    cin >> a >> b ;
    ans = b ;
    for (ll i = 0 ; i < b ; i ++ )
    {
        ans -- ;
        cin >> c ;
        n = 1 ;
        for (ll j = 1 ; j <= ans ; j ++ )
            n *= a ;
        if ((n * c) % 2 != 0)
            x ++ ;
        else
            y ++ ;
    }
    if (x % 2 == 0)
    {
        cout << "even" ;
        return 0;
    }
    cout << "odd" ;
}
///Mmavl studios
///Eco students


///                         .
///                     /   ))     |\         )               ).
///               c++. (\  ( `.    / )  (\   ( `.     ).     ( (
///               | |   ))  ) )   ( (   `.`.  ) )    ( (      ) )
///               | |  ( ( / _..----.._  ) | ( ( _..----.._  ( (
/// ,-.           | |---) V.'-------.. `-. )-/.-' ..------ `--) \._
/// | /===========| |  (   |      ) ( ``-.`\/'.-''           (   ) ``-._
/// | | / / / / / | |--------------------->  <-------------------------_>=-
/// | \===========| |                 ..-'./\.`-..                _,,-'
/// `-'           | |-------._------''_.-'----`-._``------_.-----'
///               | |         ``----''            ``----''
///               | |
///               c++`

///██╗ ██████╗ ██╗    ██████╗  ██████╗  ██████╗   ██████╗
///██║██╔═══██╗██║    ╚════██╗██╔═████╗ ╚════██╗ ██╔═████╗
///██║██║   ██║██║     █████╔╝██║██╔██║  █████╔╝ ██║██╔██║
///██║██║   ██║██║    ██╔═══╝ ████╔╝██║ ██╔═══╝  ████╔╝██║
///██║╚██████╔╝██║    ███████╗╚██████╔╝ ███████╗ ╚██████╔╝
///╚═╝ ╚═════╝ ╚═╝    ╚══════╝ ╚═════╝  ╚══════╝  ╚═════╝

#include<bits/stdc++.h>
#include<fstream>
#define ll long long
#define ld long double
#define pb push_back
#define pf push_front
#define fr first
#define sc second
#define mlojins cout.tie(NULL);
#define bzbz cin.tie(NULL);
#define CODER ios_base::sync_with_stdio(0)  ;
#define p_b pop_back
#define p_f pop_front
#define Qulukh
#define quluq return 0;
#define Zohiri_dzd
#define Mekh
#define Black_star
using namespace std ;

const ll N = 1e6 + 1;

map <char , ll> mp , pm ;
deque <ll> v , vc , ve ,vv , vd ;
deque <char> p , pe ;
deque <string> ts , ss , st ;
deque <double> sd , ds ;
ll a , b , c , d , e , f , cnt , ans , r , n , l , x , y ;
ld q , t , cnt1 , cnt2 ;
string g , h , w , o , m , s ;
char z , u ;
bool re , rt ;
vector<pair < ll , ll > > pr , rp , pp ;
map < pair < char , char > , ll > aw , wa ;
int main ()
{
    bzbz
    mlojins
    Qulukh
    Mekh
    CODER
    Zohiri_dzd
    Black_star
    ///freopen("input.txt" , "r" , stdin );
    ///freopen("output.txt", "w" , stdout );
    ///Author :: Murtazoev Alijon
    cin >> a >> b ;
    d = b ;
    d -- ;
    a %= 10 ;
    for (ll i = 0 ; i < b ; i ++ )
    {
        cin >> c ;
        ans = 1 ;
        for (ll j = 0 ; j < d ; j ++ )
        {
            if (ans == 0)
                break ;
            ans *= a , ans %= 10 ;
        }
        c %= 10 ;
        ans %= 10 ;
        ans *= c ;
        n += ans % 10 ;
        n %= 10 ;
        d -- ;
    }
    if (n % 2 == 0)
        cout << "even" << endl;
    else
        cout << "odd" << endl;
}
///Mmavl studios
///Eco students


#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

#define pb                push_back
#define ppb               pop_back
#define pf                push_front
#define ppf               pop_front
#define all(x)            (x).begin(),(x).end()
#define int               long long
#define fr                first
#define sc                second
#define vc                vector
#define endl              '\n'
#define pii               pair<int,int>
#define msi               map<string,int>
#define mii               map<int,int>
#define psi               pair<string,int>
#define pis               pair<int,string>
#define mem1(a)           memset(a,-1,sizeof(a))
#define mem0(a)           memset(a,0,sizeof(a))
#define debug(x)          cout << x << endl;
#define rep(i,a,b)        for(int i=a;i<b;i++)

template<typename T>
using oset = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;

void solve()
{
int b,k;
cin>>b>>k;
int a[k];
for(int i=0;i<k;i++)
cin>>a[i];
int even=0,od=0;
for(int i=0;i<k;i++)
{
int bk=pow(b,k-i-1);
if((bk%2)==0||(a[i]%2)==0)
even++;
else
od++;
}
if(od%2==0)
cout<<"even";
else
cout<<"odd";
}
signed main(){
    ios_base::sync_with_stdio(false);
    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);
    int t=1;
    //cin>>t;
    while(t--) solve();
    return 0;
}


#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

#define pb                push_back
#define ppb               pop_back
#define pf                push_front
#define ppf               pop_front
#define all(x)            (x).begin(),(x).end()
#define int               long long
#define fr                first
#define sc                second
#define vc                vector
#define endl              '\n'
#define pii               pair<int,int>
#define msi               map<string,int>
#define mii               map<int,int>
#define psi               pair<string,int>
#define pis               pair<int,string>
#define mem1(a)           memset(a,-1,sizeof(a))
#define mem0(a)           memset(a,0,sizeof(a))
#define debug(x)          cout << x << endl;
#define rep(i,a,b)        for(int i=a;i<b;i++)

template<typename T>
using oset = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;

void solve()
{
int b,k;
cin>>b>>k;
int a[k];
for(int i=0;i<k;i++)
cin>>a[i];
int even=0,odd=0;
for(int i=0;i<k;i++)
{
  if(b%2==0)
    even++;
  else if(a[i]%2==0)
    even++;
  else if(a[i]%2!=0&&b%2!=0)
    odd++;
}
if(odd%2==0)
cout<<"even";
else
cout<<"odd";
}
signed main(){
    ios_base::sync_with_stdio(false);
    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);
    int t=1;
    //cin>>t;
    while(t--) solve();
    return 0;
}


#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

#define pb                push_back
#define ppb               pop_back
#define pf                push_front
#define ppf               pop_front
#define all(x)            (x).begin(),(x).end()
#define int               long long
#define fr                first
#define sc                second
#define vc                vector
#define endl              '\n'
#define pii               pair<int,int>
#define msi               map<string,int>
#define mii               map<int,int>
#define psi               pair<string,int>
#define pis               pair<int,string>
#define mem1(a)           memset(a,-1,sizeof(a))
#define mem0(a)           memset(a,0,sizeof(a))
#define debug(x)          cout << x << endl;
#define rep(i,a,b)        for(int i=a;i<b;i++)

template<typename T>
using oset = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;

void solve()
{
int b,k;
cin>>b>>k;
int a[k];
for(int i=0;i<k;i++)
cin>>a[i];
int even=0,odd=0;
for(int i=0;i<k;i++)
{
int bk=pow(b,k-i-1);
if(bk%2==0||a[i]%2==0)
even++;
else
odd++;
}
if(odd%2==0)
cout<<"even";
else
cout<<"odd";
}
signed main(){
    ios_base::sync_with_stdio(false);
    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);
    int t=1;
    //cin>>t;
    while(t--) solve();
    return 0;
}


#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

#define pb                push_back
#define ppb               pop_back
#define pf                push_front
#define ppf               pop_front
#define all(x)            (x).begin(),(x).end()
#define int               long long
#define fr                first
#define sc                second
#define vc                vector
#define endl              '\n'
#define pii               pair<int,int>
#define msi               map<string,int>
#define mii               map<int,int>
#define psi               pair<string,int>
#define pis               pair<int,string>
#define mem1(a)           memset(a,-1,sizeof(a))
#define mem0(a)           memset(a,0,sizeof(a))
#define debug(x)          cout << x << endl;
#define rep(i,a,b)        for(int i=a;i<b;i++)

template<typename T>
using oset = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;

void solve()
{
int b,k;
cin>>b>>k;
int a[k];
for(int i=0;i<k;i++) cin>>a[i];
    int odd=0,even=0;
int c[k];
for(int i=1;i<=k;i++)
c[i-1]=pow(b,k-i);
for(int i=0;i<k;i++)
{
    int d=c[i]*a[i];
    if(d%2==0)
        even++;
    else odd++;
}
if(odd%2==0) cout<<"even";
else cout<<"odd";
}
signed main(){
    ios_base::sync_with_stdio(false);
    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);
    int t=1;
    //cin>>t;
    while(t--) solve();
    return 0;
}


#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

#define pb                push_back
#define ppb               pop_back
#define pf                push_front
#define ppf               pop_front
#define all(x)            (x).begin(),(x).end()
#define int               long long
#define fr                first
#define sc                second
#define vc                vector
#define endl              '\n'
#define pii               pair<int,int>
#define msi               map<string,int>
#define mii               map<int,int>
#define psi               pair<string,int>
#define pis               pair<int,string>
#define mem1(a)           memset(a,-1,sizeof(a))
#define mem0(a)           memset(a,0,sizeof(a))
#define debug(x)          cout << x << endl;
#define rep(i,a,b)        for(int i=a;i<b;i++)

template<typename T>
using oset = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;

void solve()
{
int b,k;
cin>>b>>k;
int a[k];
for(int i=0;i<k;i++)
cin>>a[i];
int even=0,odd=0;
for(int i=0;i<k;i++)
{
  if(i==k-1&&a[i]%2==0)
    even++;
  else if(i==k-1&&a[i]%2!=0)
    odd++;
  else if(b%2==0&&i!=k-1)
    even++;
  else if(a[i]%2==0)
    even++;
  else if(a[i]%2!=0&&b%2!=0)
    odd++;
}
if(odd%2==0)
cout<<"even";
else
cout<<"odd";
}
signed main(){
    ios_base::sync_with_stdio(false);
    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);
    int t=1;
    //cin>>t;
    while(t--) solve();
    return 0;
}


#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

#define pb                push_back
#define ppb               pop_back
#define pf                push_front
#define ppf               pop_front
#define all(x)            (x).begin(),(x).end()
#define int               long long
#define fr                first
#define sc                second
#define vc                vector
#define endl              '\n'
#define pii               pair<int,int>
#define msi               map<string,int>
#define mii               map<int,int>
#define psi               pair<string,int>
#define pis               pair<int,string>
#define mem1(a)           memset(a,-1,sizeof(a))
#define mem0(a)           memset(a,0,sizeof(a))
#define debug(x)          cout << x << endl;
#define rep(i,a,b)        for(int i=a;i<b;i++)

template<typename T>
using oset = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;

void solve()
{
int b,k;
cin>>b>>k;
int a[k];
for(int i=0;i<k;i++) cin>>a[i];
    int odd=0,even=0,sum=0;
int c[k];
for(int i=1;i<=k;i++)
{
c[i-1]=pow(b,k-i)*a[i-1];
if(c[i-1]%2!=0)
    odd++;
}

if(odd%2==0)
    cout<<"even";
else
    cout<<"odd";
}
signed main(){
    ios_base::sync_with_stdio(false);
    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);
    int t=1;
    //cin>>t;
    while(t--) solve();
    return 0;
}


#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

#define pb                push_back
#define ppb               pop_back
#define pf                push_front
#define ppf               pop_front
#define all(x)            (x).begin(),(x).end()
#define int               long long
#define fr                first
#define sc                second
#define vc                vector
#define endl              '\n'
#define pii               pair<int,int>
#define msi               map<string,int>
#define mii               map<int,int>
#define psi               pair<string,int>
#define pis               pair<int,string>
#define mem1(a)           memset(a,-1,sizeof(a))
#define mem0(a)           memset(a,0,sizeof(a))
#define debug(x)          cout << x << endl;
#define rep(i,a,b)        for(int i=a;i<b;i++)

template<typename T>
using oset = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;

void solve()
{
int b,k;
cin>>b>>k;
int a[k];
for(int i=0;i<k;i++) cin>>a[i];
    int odd=0,even=0,sum=0;
int c[k];
for(int i=1;i<=k;i++)
{
c[i-1]=pow(b,k-i)*a[i-1];
sum=sum+c[i-1];
}

if(sum%2==0)
    cout<<"even";
else
    cout<<"odd";
}
signed main(){
    ios_base::sync_with_stdio(false);
    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);
    int t=1;
    //cin>>t;
    while(t--) solve();
    return 0;
}


#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define ld long double
#define pb push_back
#define pf push_front
#define mp make_pair

#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>

#define rev(v) reverse(v.begin(),v.end())
#define srt(v) sort(v.begin(),v.end())
#define grtsrt(v) sort(v.begin(),v.end(),greater<ll>())

#define pi acos(-1.0)

using namespace std;

int main()
{
    int b,k;
    cin>>b>>k;

    int a[k];

    for(int i=0 ; i<k ; i++)
        cin>>a[i];

    int kk=k-1;
    ll ans=0;
    ll temp=b;

    for(int j=1 ; j<kk ; j++)
    {
        temp=temp*b;
        //cout<<temp<<endl;
    }

    ll temp2=0;

    for(int i=0 ; i<k ; i++)
    {
        temp2=temp * a[i];
        //cout<<" temp : "<<temp<<endl;
        //cout<<"temp 2 "<<temp2<<endl;
        ans = ans + temp2;

        temp=temp/b;

    }
    //cout<<ans<<endl;

    if(ans%2==0 && ans!=0)
        cout<<"even"<<endl;

    else
        cout<<"odd"<<endl;

    return 0;
}


#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define ld long double
#define pb push_back
#define pf push_front
#define mp make_pair

#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>

#define rev(v) reverse(v.begin(),v.end())
#define srt(v) sort(v.begin(),v.end())
#define grtsrt(v) sort(v.begin(),v.end(),greater<ll>())

#define pi acos(-1.0)

using namespace std;

int main()
{

    int b,k;
    cin>>b>>k;

    ll sum = 0 ;

    for(int i=k-1 ; i>=0 ; i--)
    {
        int x;
        cin>>x;
        sum = sum + x * (ceil(pow(b,i)))
        ;

    }

    if(sum%2)
        cout<<"odd"<<endl;
    else
        cout<<"even"<<endl;

    return 0;
}


#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define ld long double
#define pb push_back
#define pf push_front
#define mp make_pair

#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>

#define rev(v) reverse(v.begin(),v.end())
#define srt(v) sort(v.begin(),v.end())
#define grtsrt(v) sort(v.begin(),v.end(),greater<ll>())

#define pi acos(-1.0)

using namespace std;

int main()
{
    int b,k;
    cin>>b>>k;

    int a[k];

    for(int i=0 ; i<k ; i++)
        cin>>a[i];

    int kk=k-1;
    ll ans=0;
    ll temp=b;

    for(int j=1 ; j<kk ; j++)
    {
        temp=temp*b;
        //cout<<temp<<endl;
    }

    ll temp2=0;

    for(int i=0 ; i<k ; i++)
    {
        temp2=temp * a[i];
        //cout<<" temp : "<<temp<<endl;
        //cout<<"temp 2 "<<temp2<<endl;
        ans = ans + temp2;

        temp=temp/b;

    }
    //cout<<ans<<endl;

    if(ans%2==0)
        cout<<"even"<<endl;

    else
        cout<<"odd"<<endl;

    return 0;
}


#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define ld long double
#define pb push_back
#define pf push_front
#define mp make_pair

#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>

#define rev(v) reverse(v.begin(),v.end())
#define srt(v) sort(v.begin(),v.end())
#define grtsrt(v) sort(v.begin(),v.end(),greater<ll>())

#define pi acos(-1.0)

using namespace std;

int main()
{
    int b;
    ll k;
    cin>>b>>k;

    int a[k+5];

    for(int i=0 ; i<k ; i++)
        cin>>a[i];

    int kk=k-1;
    ll ans=0;
    ll temp=b;

    for(int j=1 ; j<kk ; j++)
    {
        temp=temp*b;
        //cout<<temp<<endl;
    }

    ll temp2=0;

    for(int i=0 ; i<k ; i++)
    {
        temp2=temp * a[i];
        //cout<<" temp : "<<temp<<endl;
        //cout<<"temp 2 "<<temp2<<endl;
        ans = ans + temp2;

        temp=temp/b;

    }
    //cout<<ans<<endl;

    if(ans%2==0 )
        cout<<"even"<<endl;

    else
        cout<<"odd"<<endl;

    return 0;
}


#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define ld long double
#define pb push_back
#define pf push_front
#define mp make_pair

#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>

#define rev(v) reverse(v.begin(),v.end())
#define srt(v) sort(v.begin(),v.end())
#define grtsrt(v) sort(v.begin(),v.end(),greater<ll>())

#define pi acos(-1.0)

using namespace std;

int main()
{
    int b,k;
    cin>>b>>k;

    int a[k];

    for(int i=0 ; i<k ; i++)
        cin>>a[i];

    int kk=k-1;
    ll ans=0;
    int temp=b;

    for(int j=1 ; j<kk ; j++)
    {
        temp=temp*b;
        //cout<<temp<<endl;
    }

    int temp2=0;

    for(int i=0 ; i<k ; i++)
    {
        temp2=temp * a[i];
        //cout<<" temp : "<<temp<<endl;
        //cout<<"temp 2 "<<temp2<<endl;
        ans = ans + temp2;

        temp=temp/b;

    }

    if(ans%2==0)
        cout<<"even"<<endl;

    else
        cout<<"odd"<<endl;

    return 0;
}


#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define ld long double
#define pb push_back
#define pf push_front
#define mp make_pair

#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>

#define rev(v) reverse(v.begin(),v.end())
#define srt(v) sort(v.begin(),v.end())
#define grtsrt(v) sort(v.begin(),v.end(),greater<ll>())

#define pi acos(-1.0)

using namespace std;

int main()
{
    int b,k;
    cin>>b>>k;

    int a[k];

    for(int i=0 ; i<k ; i++)
        cin>>a[i];

    int kk=k-1;
    ll ans=0;
    ll temp=b;

    for(int j=1 ; j<kk ; j++)
    {
        temp=temp*b;
        //cout<<temp<<endl;
    }

    ll temp2=0;

    for(int i=0 ; i<k ; i++)
    {
        temp2=temp * a[i];
        //cout<<" temp : "<<temp<<endl;
        //cout<<"temp 2 "<<temp2<<endl;
        ans = ans + temp2;

        temp=temp/b;

    }
    //cout<<ans<<endl;

    if(ans%2==0 || ans!=0)
        cout<<"even"<<endl;

    else
        cout<<"odd"<<endl;

    return 0;
}


#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define ld long double
#define pb push_back
#define pf push_front
#define mp make_pair

#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>

#define rev(v) reverse(v.begin(),v.end())
#define srt(v) sort(v.begin(),v.end())
#define grtsrt(v) sort(v.begin(),v.end(),greater<ll>())

#define pi acos(-1.0)

using namespace std;

int main()
{
    int b,k;
    cin>>b>>k;
    int xx=0,x=0;

    int f;
    for(int i=1 ; i<k ; i++)
    {
        cin>>f;
        if(f%2!=0)
        {
            xx++;
        }

    }
    cin>>f;
        if(f%2!=0)
            x++;
            //cout<<xx<<" "<<x<<endl;

    if(b%2!=0)
    {
        xx=x+xx;

        if(xx%2!=0)
            cout<<"odd"<<endl;
        else
            cout<<"even"<<endl;

    }

    else
    {
        if(x%2!=0)
            cout<<"odd"<<endl;

        else
            cout<<"even"<<endl;
    }

    return 0;
}


#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define ld long double
#define pb push_back
#define pf push_front
#define mp make_pair

#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>

#define rev(v) reverse(v.begin(),v.end())
#define srt(v) sort(v.begin(),v.end())
#define grtsrt(v) sort(v.begin(),v.end(),greater<ll>())

#define pi acos(-1.0)

using namespace std;

int main()
{
    int b,k;
    cin>>b>>k;

    int a[k];

    for(int i=0 ; i<k ; i++)
        cin>>a[i];

    int kk=k-1;
    ll ans=0;
    ll temp=b;

    for(int j=1 ; j<kk ; j++)
    {
        temp=temp*b;
        //cout<<temp<<endl;
    }

    ll temp2=0;

    for(int i=0 ; i<k ; i++)
    {
        temp2=temp * a[i];
        //cout<<" temp : "<<temp<<endl;
        //cout<<"temp 2 "<<temp2<<endl;
        ans = ans + temp2;

        temp=temp/b;

    }
    cout<<ans<<endl;

    if(ans%2==0 && ans!=0)
        cout<<"even"<<endl;

    else
        cout<<"odd"<<endl;

    return 0;
}


//  Suraj Saste

#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define in insert
#define fe first
#define se second
#define ms(x,i) memset(x,i,sizeof(x))
#define prec(x) cout<<std::setprecision(x)
#define mod 1000000007
#define all(x) x.begin(),x.end()
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
ll fpow(ll n, ll k, ll p=mod) {ll r=1; n=n%p; while(k>0){ if(k&1){ r=(r*n)%p; } k=k>>1; n=(n*n)%p; } return r;}
bool isPrime(ll n){ if(n<=1)return false;if(n<=3)return true;if(n%2==0 || n%3==0)return false;for(ll i=5;i*i<=n;i+=6){if(n%i==0||n%(i+2)==0)return false;}return true;}

int main()
{
	fast;
	ll b,k;cin>>b>>k;
	ll a[k];
	for(ll i=0;i<k;i++)cin>>a[i];
	ll sum=0;
    ll p=k;
    ll ans=0;
	for(ll i=0;i<k;i++)
	{
		p--;
		ans+=(a[i]%10)*(pow(b,p));
		ans=ans%10;
	}
	//cout<<ans<<"\n";
	if(ans%2==1)cout<<"odd";
	else cout<<"even";
	return 0;
}


//  Suraj Saste

#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define in insert
#define fe first
#define se second
#define ms(x,i) memset(x,i,sizeof(x))
#define prec(x) cout<<std::setprecision(x)
#define mod 1000000007
#define all(x) x.begin(),x.end()
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
ll fpow(ll n, ll k, ll p=mod) {ll r=1; n=n%p; while(k>0){ if(k&1){ r=(r*n)%p; } k=k>>1; n=(n*n)%p; } return r;}
bool isPrime(ll n){ if(n<=1)return false;if(n<=3)return true;if(n%2==0 || n%3==0)return false;for(ll i=5;i*i<=n;i+=6){if(n%i==0||n%(i+2)==0)return false;}return true;}

int main()
{
	fast;
	ll b,k;cin>>b>>k;
	ll a[k];
	for(ll i=0;i<k;i++)cin>>a[i];
	ll sum=0;
    ll p=k;
    ll ans=0;
	for(ll i=0;i<k;i++)
	{
		p--;
		ll o=pow(b,p);
		o=o%10;
		ans+=(a[i]%10)*o;
		ans=ans%10;
	}
	//cout<<ans<<"\n";
	if(ans%2==1)cout<<"odd";
	else cout<<"even";
	return 0;
}


//  Suraj Saste

#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define in insert
#define fe first
#define se second
#define ms(x,i) memset(x,i,sizeof(x))
#define prec(x) cout<<std::setprecision(x)
#define mod 10
#define all(x) x.begin(),x.end()
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
ll fpow(ll n, ll k, ll p=mod) {ll r=1; n=n%p; while(k>0){ if(k&1){ r=(r*n)%p; } k=k>>1; n=(n*n)%p; } return r;}
bool isPrime(ll n){ if(n<=1)return false;if(n<=3)return true;if(n%2==0 || n%3==0)return false;for(ll i=5;i*i<=n;i+=6){if(n%i==0||n%(i+2)==0)return false;}return true;}

int main()
{
	fast;
	ll b,k;cin>>b>>k;
	ll a[k];
	for(ll i=0;i<k;i++)cin>>a[i];
	ll sum=0;
    ll p=k;
    ll ans=0;
	for(ll i=0;i<k;i++)
	{
		p--;
		ll o=fpow(b,p);
		o=o%10;
		ans+=(a[i]%10)*o;
		ans=ans%10;
	}
	//cout<<ans<<"\n";
	if(ans%2==1)cout<<"odd";
	else cout<<"even";
	return 0;
}


//  Suraj Saste

#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define in insert
#define fe first
#define se second
#define ms(x,i) memset(x,i,sizeof(x))
#define prec(x) cout<<std::setprecision(x)
#define mod 1000000007
#define all(x) x.begin(),x.end()
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
ll fpow(ll n, ll k, ll p=mod) {ll r=1; n=n%p; while(k>0){ if(k&1){ r=(r*n)%p; } k=k>>1; n=(n*n)%p; } return r;}
bool isPrime(ll n){ if(n<=1)return false;if(n<=3)return true;if(n%2==0 || n%3==0)return false;for(ll i=5;i*i<=n;i+=6){if(n%i==0||n%(i+2)==0)return false;}return true;}

int main()
{
	fast;
	ll b,k;cin>>b>>k;
	ll a[k];
	for(ll i=0;i<k;i++)cin>>a[i];
	ll sum=0;
    ll p=k;
    ll ans=0;
	for(ll i=0;i<k;i++)
	{
		p--;
		ans+=(a[i])*(pow(b,p));
	}
	//cout<<ans<<"\n";
	if(ans%2==1)cout<<"odd";
	else cout<<"even";
	return 0;
}


//  Suraj Saste

#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define in insert
#define fe first
#define se second
#define ms(x,i) memset(x,i,sizeof(x))
#define prec(x) cout<<std::setprecision(x)
#define mod 1000000007
#define all(x) x.begin(),x.end()
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
ll fpow(ll n, ll k, ll p=mod) {ll r=1; n=n%p; while(k>0){ if(k&1){ r=(r*n)%p; } k=k>>1; n=(n*n)%p; } return r;}
bool isPrime(ll n){ if(n<=1)return false;if(n<=3)return true;if(n%2==0 || n%3==0)return false;for(ll i=5;i*i<=n;i+=6){if(n%i==0||n%(i+2)==0)return false;}return true;}

int main()
{
	fast;
	ll b,k;cin>>b>>k;
	ll a[k];
	for(ll i=0;i<k;i++)cin>>a[i];
	ll sum=0;
    ll p=k;
    ll ans=0;
	for(ll i=0;i<k;i++)
	{
		p--;
		ll o=fpow(b,p);
		o=o%10;
		ans+=(a[i]%10)*o;
		ans=ans%10;
	}
	//cout<<ans<<"\n";
	if(ans%2==1)cout<<"odd";
	else cout<<"even";
	return 0;
}


//  Suraj Saste

#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define in insert
#define fe first
#define se second
#define ms(x,i) memset(x,i,sizeof(x))
#define prec(x) cout<<std::setprecision(x)
#define mod 1000000007
#define all(x) x.begin(),x.end()
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
ll fpow(ll n, ll k, ll p=mod) {ll r=1; n=n%p; while(k>0){ if(k&1){ r=(r*n)%p; } k=k>>1; n=(n*n)%p; } return r;}
bool isPrime(ll n){ if(n<=1)return false;if(n<=3)return true;if(n%2==0 || n%3==0)return false;for(ll i=5;i*i<=n;i+=6){if(n%i==0||n%(i+2)==0)return false;}return true;}

int main()
{
	fast;
	ll b,k;cin>>b>>k;
	ll a[k];
	for(ll i=0;i<k;i++)cin>>a[i];
	ll sum=0;
    ll p=k;
    ll ans=0;
	for(ll i=0;i<k;i++)
	{
		p--;
		//ll o=fpow(b,p);
		ll o=1;
		for(ll j=1;j<=p;j++)
		{
			o=o*(b%10);
			o=o%10;
		}
		ans+=(a[i]%10)*o;
		ans=ans%10;
	}
	//cout<<ans<<"\n";
	if(ans%2==1)cout<<"odd";
	else cout<<"even";
	return 0;
}


#include<bits/stdc++.h>
using namespace std;
int po(int x, int y)
{
    int temp;
    if( y == 0)
       return 1;
    temp = po(x, y/2);
    if (y%2 == 0)
        return temp*temp;
    else
    {
        if(y > 0)
            return x*temp*temp;
        else
            return (temp*temp)/x;
    }
}
int main()
{
    int b,k,a[1000],sum=0;;
    cin>>b>>k;
    int l=k;
    for(int i=0; i<k; i++)
    {
        cin>>a[i];
        l--;
        int p=po(b,l);
        sum+= (a[i]*p);
    }
    if(sum%2==0)cout<<"even"<<endl;
    else
        cout<<"odd"<<endl;

}


//cout<<"logic is : (even*odd)=even"<<endl;
#include<bits/stdc++.h>
using namespace std;
int main()
{
    long long b,k,sum=0,n;
    cin>>b>>k;
    for(int i=0; i<k; i++)
    {
        cin>>n;
        sum+=n;
    }
    if(b%2==0)
    {
        if(n%2==0)
            cout<<"even"<<endl;
        else
            cout<<"odd"<<endl;
    }
    else
    {
        if(sum%2==0)
            cout<<"even"<<endl;
        else
            cout<<"odd"<<endl;
    }
}


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

int main()
{
    int b,k,a[1000],sum=0;;
    cin>>b>>k;
    int l=k;
    for(int i=0; i<k; i++)
    {
        cin>>a[i];
        l--;
        int p=pow(b,l);
        sum+= (a[i]*p);
    }
    if(sum%2==0)cout<<"even"<<endl;
    else
        cout<<"odd"<<endl;

}


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

int main()
{
    int b,k,a[1000],sum=0;;
    scanf("%d %d",&b,&k);
    int l=k;
    for(int i=0; i<k; i++)
    {
        cin>>a[i];
        l--;
        int p=pow(b,l);
        sum+= (a[i]*p);
    }
    if(sum%2==0)printf("even\n");
    else
        printf("odd\n");

}


#include<bits/stdc++.h>
using namespace std;
int po(int x, unsigned int y)
{
    if (y == 0)
        return 1;
    else if (y%2 == 0)
        return po(x, y/2)*po(x, y/2);
    else
        return x*po(x, y/2)*po(x, y/2);
}
int main()
{
    int b,k,a,sum=0;
    char ch[1000];
    cin>>b>>k;
    int l=k;
    for(int i=0; i<k; i++)
    {
        cin>>a;
        l--;
        int p=po(b,l);
        sum+= (a*p);
    }
    //cout<<sum<<endl;
    sprintf(ch,"%d",sum);
    int len=strlen(ch);
    //cout<<ch[0]<<endl;
    //cout<<len<<endl;
    if(ch[len-1]=='0'||ch[len-1]=='2'||ch[len-1]=='4'||ch[len-1]=='6'||ch[len-1]=='8')cout<<"even"<<endl;
    else
        cout<<"odd"<<endl;
}


#include<bits/stdc++.h>
using namespace std;
long long po(long long x, unsigned long long y)
{
    if (y == 0)
        return 1;
    else if (y%2 == 0)
        return po(x, y/2)*po(x, y/2);
    else
        return x*po(x, y/2)*po(x, y/2);
}
int main()
{
    long long b,k,a[1000],sum=0;
    char ch[1000];
    cin>>b>>k;
    int l=k;
    for(long long i=0; i<k; i++)
    {
        cin>>a[i];
    }
    for(long long i=0; i<k; i++)
    {
         l--;
        int p=po(b,l);
        sum+= (a[i]*p);
    }
    //cout<<sum<<endl;
    sprintf(ch,"%lld",sum);
    int len=strlen(ch);
    //cout<<sum<<endl;
    //cout<<ch[0]<<endl;
    //cout<<len<<endl;
    if(ch[len-1]=='0'||ch[len-1]=='2'||ch[len-1]=='4'||ch[len-1]=='6'||ch[len-1]=='8')cout<<"even"<<endl;
    else
        cout<<"odd"<<endl;
}


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

int main()
{
    int b,k,a,sum=0;;
    scanf("%d %d",&b,&k);
    int l=k;
    int temp,c=1;
    for(int i=0; i<k; i++)
    {
        scanf("%d",&a);
        l--;
        c=1;
        //int p=pow(b,l);
        for(int j=1; j<=l;j++)
        {
            temp=b;
            c=c*temp;
        }
        sum+= (a*c);
        //cout<<sum<<endl;
    }
    //cout<<sum<<endl;
    if(sum%2==0)printf("even\n");
    else
        printf("odd\n");

}


#include<bits/stdc++.h>
using namespace std;
long long po(long long x, unsigned long long y)
{
    if (y == 0)
        return 1;
    else if (y%2 == 0)
        return po(x, y/2)*po(x, y/2);
    else
        return x*po(x, y/2)*po(x, y/2);
}
int main()
{
    long long b,k,a[1000],sum=0;
    char ch[1000];
    cin>>b>>k;
    int l=k;
    for(long long i=0; i<k; i++)
    {
        cin>>a[i];
    }
    for(long long i=0; i<k; i++)
    {
         l--;
        int p=po(b,l);
        sum+= (a[i]*p);
    }
    //cout<<sum<<endl;
    sprintf(ch,"%lld",sum);
    int len=strlen(ch);
    cout<<sum<<endl;
    //cout<<ch[0]<<endl;
    //cout<<len<<endl;
    if(ch[len-1]=='0'||ch[len-1]=='2'||ch[len-1]=='4'||ch[len-1]=='6'||ch[len-1]=='8')cout<<"even"<<endl;
    else
        cout<<"odd"<<endl;
}


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

int main()
{
    int b,k,a[1000],sum=0;;
    scanf("%d %d",&b,&k);
    int l=k;
    int temp,c=1;
    for(int i=0; i<k; i++)
    {
        cin>>a[i];
        l--;
        c=1;
        //int p=pow(b,l);
        for(int j=1; j<=l;j++)
        {
            temp=b;
            c=c*temp;
        }
        sum+= (a[i]*c);
        //cout<<sum<<endl;
    }
    //cout<<sum<<endl;
    if(sum%2==0)printf("even\n");
    else
        printf("odd\n");

}


#include<bits/stdc++.h>
using namespace std;
int main()
{
    long long b,k,sum=0,n,i;
    scanf("%lld %lld",&b,&k);
    for(i=0; i<k; i++)
    {
        scanf("%lld",&n);
        sum+=n;
    }
    if(b%2==0)
    {
        if(n%2==0)
            printf("even\n");
        else
            printf("odd\n");
    }
    else
    {
        if(sum%2==0)
            printf("even\n");
        else
            printf("odd\n");
    }
}


#include<bits/stdc++.h>
using namespace std;
int po(int x, unsigned int y)
{
    if (y == 0)
        return 1;
    else if (y%2 == 0)
        return po(x, y/2)*po(x, y/2);
    else
        return x*po(x, y/2)*po(x, y/2);
}
int main()
{
    int b,k,a[1000],sum=0;;
    cin>>b>>k;
    int l=k;
    for(int i=0; i<k; i++)
    {
        cin>>a[i];
        l--;
        int p=po(b,l);
        sum+= (a[i]*p);
    }
    if(sum%2==0)cout<<"even"<<endl;
    else
        cout<<"odd"<<endl;

}


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

int main()
{
    int b,k,a,sum=0;;
    scanf("%d %d",&b,&k);
    int l=k;
    int temp,c=1;
    for(int i=0; i<k; i++)
    {
        cin>>a;
        l--;
        c=1;
        //int p=pow(b,l);
        for(int j=1; j<=l;j++)
        {
            temp=b;
            c=c*temp;
        }
        sum+= (a*c);
        //cout<<sum<<endl;
    }
    //cout<<sum<<endl;
    if(sum%2==0)printf("even\n");
    else
        printf("odd\n");

}


#include <iostream>
#include <stdio.h>

using namespace std;

#define FOR(i,l,r) for(int i = l; i <= r; ++i)

int B,K;
int A[12345];

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie();
    cout.tie();
    //
    cin >> B >> K;
    int mod = 1;

    FOR(i,1,K) cin >> A[i];

    int res = 0;
    for(int i = K; i > 0; --i){
        res = res + A[i] * mod;
        res %= 10;
        mod = (mod * B) % 10;
    }
    if(res % 2 == 0) cout << "even";
    else cout << "odd";

    return 0;
}


#include <iostream>
#include <stdio.h>

using namespace std;

#define LL long long
#define FOR(i,l,r) for(int i = l; i <= r; ++i)

int B,K;
LL A[123456];

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie();
    cout.tie();
    //
    cin >> B >> K;
    B = B % 2;

    FOR(i,1,K) cin >> A[i];

    LL res = A[K] % 2;
    FOR(i,1,K - 1){
        if(B == 1) res += A[i];
        res %= 2;
    }
    if(res % 2 == 0) cout << "even";
    else cout << "odd";

    return 0;
}


#include <iostream>
#include <stdio.h>

using namespace std;

#define LL long long
#define FOR(i,l,r) for(int i = l; i <= r; ++i)

int B,K;
LL A[12345];

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie();
    cout.tie();
    //
    cin >> B >> K;
    LL mod = 1;

    FOR(i,1,K) cin >> A[i];

    LL res = 0;
    for(int i = K; i > 0; --i){
        res = res + A[i] * mod;
        res %= 10;
        mod = (mod * B) % 10;
    }
    if(res % 2 == 0) cout << "even";
    else cout << "odd";

    return 0;
}


#include <bits/stdc++.h>

using namespace std;

#define LL long long
#define FOR(i,l,r) for(int i=l;i <= r; ++i)

int main(){
    int b,k;
    cin >> b >> k;
    int s = 0;

    FOR(i,1,k){
        int x;
        cin >> x;
        x %= 2;
        if(i < k) x *= b % 2;
        s += x;
    }

    if(s % 2 == 0) cout << "even";
    else cout << "odd";

    return 0;
}


#include <bits/stdc++.h>

using namespace std;

#define LL long long
#define FOR(i,l,r) for(int i=l;i <= r; ++i)

int main(){
    cin >> b >> k;
    int s = 0;

    FOR(i,1,k){
        int x;
        cin >> x;
        x %= 2;
        if(i < k) x *= b % 2;
        s += x;
    }

    if(s % 2 == 0) cout << "even";
    else cout << "odd";

    return 0;
}


#include <iostream>
#include <stdio.h>

using namespace std;

#define LL long long
#define FOR(i,l,r) for(int i = l; i <= r; ++i)

int B,K;
LL A[12345];

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie();
    cout.tie();
    //
    cin >> B >> K;
    LL mod = 1;

    FOR(i,1,K) cin >> A[i];

    LL res = A[K] % 2;
    FOR(i,1,K - 1){
        res += A[i] * (B % 2);
        res %= 2;
    }
    if(res % 2 == 0) cout << "even";
    else cout << "odd";

    return 0;
}


#include <iostream>
#include <stdio.h>

using namespace std;

#define LL long long
#define FOR(i,l,r) for(int i = l; i <= r; ++i)

int B,K;
LL A[123456];

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie();
    cout.tie();
    //
    cin >> B >> K;
    B = B % 2;
    LL mod = 1;

    FOR(i,1,K) cin >> A[i];

    LL res = A[K] % 2;
    FOR(i,1,K - 1){
        if(B == 1) res += A[i];
        res %= 2;
    }
    if(res) cout << "even";
    else cout << "odd";

    return 0;
}


#include <bits/stdc++.h>
using namespace std;
#define ull unsigned long long
#define ll long long
#define u unsigned
#define s signed
s main(){
  cin.tie(NULL);
  cin.sync_with_stdio(NULL);
  cout.tie(NULL);
  cout.sync_with_stdio(NULL);
  ull b,k; cin >> b >> k;
  ull num = 0;
  ull even = 0;
  ull odd = 0;
  for(ull x = 0;x < k;x++){
    ull a; cin >> a;
    ull n = a*(ull)pow(b,k-1-x);
    if(n%2==0)
      even++;
    else
      odd++;
    // num += a*(ull)pow(b,k-1-x);
  }
  if(odd%2==0)
    cout << "even\n";
  else
    cout << "odd\n";
}


#include <bits/stdc++.h>
using namespace std;
#define ull unsigned long long
#define ll long long
#define u unsigned
#define s signed
s main(){
  cin.tie(NULL);
  cin.sync_with_stdio(NULL);
  cout.tie(NULL);
  cout.sync_with_stdio(NULL);
  ull b,k; cin >> b >> k;
  ull odd = 0;
  for(ull x = 0;x < k;x++){
    ull a; cin >> a;
    // ull n = a*(ull)pow(b,k-1-x);
    if(a%2==1 && (b%2==1|| x == k-1))
      odd++;
  }
  if(odd%2==0)
    cout << "even\n";
  else
    cout << "odd\n";
}


#include <bits/stdc++.h>
using namespace std;
#define ull unsigned long long
#define ll long long
#define u unsigned
#define s signed
s main(){
	cin.tie(NULL);
	cin.sync_with_stdio(NULL);
	cout.tie(NULL);
	cout.sync_with_stdio(NULL);
	ull b,k; cin >> b >> k;
	ull num = 0;
	for(ull x = 0;x < k;x++){
		ull a; cin >> a;
		num += a*(ull)pow(b,k-1-x);
	}
	if(num%2==0)
		cout<<"even\n";
	else
		cout<<"odd\n";
}


#include <bits/stdc++.h>
using namespace std;
#define ull unsigned long long
#define ll long long
#define u unsigned
#define s signed
s main(){
	cin.tie(NULL);
	cin.sync_with_stdio(NULL);
	cout.tie(NULL);
	cout.sync_with_stdio(NULL);
	ull b,k; cin >> b >> k;
	ull num = 0;
	for(int x = 0;x < k;x++){
		int a; cin >> a;
		num += a*(ull)pow(b,k-1-x);
	}
	if(num%2==0)
		cout<<"even";
	else
		cout<<"odd";
}


#include <bits/stdc++.h>
using namespace std;
#define ull unsigned long long
#define ll long long
#define u unsigned
#define s signed
s main(){
  cin.tie(NULL);
  cin.sync_with_stdio(NULL);
  cout.tie(NULL);
  cout.sync_with_stdio(NULL);
  ull b,k; cin >> b >> k;
  ull odd = 0;
  for(ull x = 0;x < k;x++){
    ull a; cin >> a;
    // ull n = a*(ull)pow(b,k-1-x);
    if(a%2==1 && (b%2==1|| x == k-1))
      odd++;
  }
  if(odd%2==1)
    cout << "even\n";
  else
    cout << "odd\n";
}


#include <bits/stdc++.h>
using namespace std;
#define ull unsigned long long
#define ll long long
#define u unsigned
#define s signed
s main(){
	cin.tie(NULL);
	cin.sync_with_stdio(NULL);
	cout.tie(NULL);
	cout.sync_with_stdio(NULL);
	ull b,k; cin >> b >> k;
	ull num = 0;
	for(int x = 0;x < k;x++){
		int a; cin >> a;
		num += a*pow(b,k-1-x);
	}
	if(num%2==0)
		cout<<"even";
	else
		cout<<"odd";
}


#include <bits/stdc++.h>
using namespace std;
#define ull unsigned long long
#define ll long long
#define u unsigned
#define s signed
s main(){
  cin.tie(NULL);
  cin.sync_with_stdio(NULL);
  cout.tie(NULL);
  cout.sync_with_stdio(NULL);
  ull b,k; cin >> b >> k;
  ull odd = 0;
  for(ull x = 0;x < k;x++){
    ull a; cin >> a;
    // ull n = a*(ull)pow(b,k-1-x);
    if(a%2==1 && b%2==1);
      odd++;
  }
  if(odd%2==1)
    cout << "even\n";
  else
    cout << "odd\n";
}


#include <bits/stdc++.h>

using namespace std;

#define REP(i,a,b) for (int i = a; i <= b; i++)
#define REP_REV(i,a,b) for (int i = a; i >= b; i--)
#define debug(x) cerr << #x << " is " << x << endl;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).end()
#define sz(x) (int)(x).size()

#define pb push_back
#define rsz resize
#define f first
#define s second
#define mp make_pair

using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vc = vector<char>;
using ull = unsigned long long ;
using pi = pair<int, int>;
using vl = vector<long long>;
using pl = pair<long long, long long>;
using vpl = vector<pair<long long, long long>>;
using msl = map<string, long long>;
using vvl = vector<vector<long long>>;

ll MOD = 1e9 + 7;
const int INF = int(1e9);

struct Rect {
	ll x1 = 0, y1 = 0, x2 = 0, y2 = 0;
	ll area() { return (x2 - x1) * (y2 - y1); }
};

Rect intersect(Rect p, Rect q) {
	Rect inter;
	inter.x1 = max(p.x1, q.x1);
	inter.y1 = max(p.y1, q.y1);
	inter.x2 = min(p.x2, q.x2);
	inter.y2 = min(p.y2, q.y2);
	if (inter.x1 >= inter.x2 || inter.y1 >= inter.y2) {
		Rect empty;
		return empty;
	}
	return inter;
}

bool iscovered(int x, int y, int x1, int y1, int x2, int y2) {
	return (x <= x2 && x >= x1 && y <= y2 && y >= y1);
}

bool isPrime(int n) {
	if (n == 2) return true;
	for(int i = 2; i * i <= n; i++) {
		if (n % i == 0) return false;
	}
	return true;
}

unsigned long long factorial(int n) {
    const unsigned int M = MOD;
    unsigned long long f = 1;
    for (int i = 1; i <= n; i++)
        f = (f*i) % M;
    return f;
}

void solve() {
	string s;
	cin >> s;
	cout << 3;
	cout << "L 2\n";
	cout << "R " << sz(s) + 1 << endl;
	cout << "R " << 2*sz(s) - 2 << endl;

}
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	// ll t; cin >> t;
	// while (t--)
		solve();
	return 0;
}


#include <bits/stdc++.h>

using namespace std;

#define REP(i,a,b) for (int i = a; i <= b; i++)
#define REP_REV(i,a,b) for (int i = a; i >= b; i--)
#define debug(x) cerr << #x << " is " << x << endl;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).end()
#define sz(x) (int)(x).size()

#define pb push_back
#define rsz resize
#define f first
#define s second
#define mp make_pair

using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vc = vector<char>;
using ull = unsigned long long ;
using pi = pair<int, int>;
using vl = vector<long long>;
using pl = pair<long long, long long>;
using vpl = vector<pair<long long, long long>>;
using msl = map<string, long long>;
using vvl = vector<vector<long long>>;

ll MOD = 1e9 + 7;
const int INF = int(1e9);

struct Rect {
	ll x1 = 0, y1 = 0, x2 = 0, y2 = 0;
	ll area() { return (x2 - x1) * (y2 - y1); }
};

Rect intersect(Rect p, Rect q) {
	Rect inter;
	inter.x1 = max(p.x1, q.x1);
	inter.y1 = max(p.y1, q.y1);
	inter.x2 = min(p.x2, q.x2);
	inter.y2 = min(p.y2, q.y2);
	if (inter.x1 >= inter.x2 || inter.y1 >= inter.y2) {
		Rect empty;
		return empty;
	}
	return inter;
}

bool iscovered(int x, int y, int x1, int y1, int x2, int y2) {
	return (x <= x2 && x >= x1 && y <= y2 && y >= y1);
}

bool isPrime(int n) {
	if (n == 2) return true;
	for(int i = 2; i * i <= n; i++) {
		if (n % i == 0) return false;
	}
	return true;
}

unsigned long long factorial(int n) {
    const unsigned int M = MOD;
    unsigned long long f = 1;
    for (int i = 1; i <= n; i++)
        f = (f*i) % M;
    return f;
}

void solve() {
	string s;
	cin >> s;
	cout << 3 << endl;
	cout << "L 2" << endl;
	cout << "R 2" << endl;
	cout << "R " << 2*sz(s) - 1 << endl;

}
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	// ll t; cin >> t;
	// while (t--)
		solve();
	return 0;
}


#include <bits/stdc++.h>

using namespace std;

#define REP(i,a,b) for (int i = a; i <= b; i++)
#define REP_REV(i,a,b) for (int i = a; i >= b; i--)
#define debug(x) cerr << #x << " is " << x << endl;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).end()
#define sz(x) (int)(x).size()

#define pb push_back
#define rsz resize
#define f first
#define s second
#define mp make_pair

using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vc = vector<char>;
using ull = unsigned long long ;
using pi = pair<int, int>;
using vl = vector<long long>;
using pl = pair<long long, long long>;
using vpl = vector<pair<long long, long long>>;
using msl = map<string, long long>;
using vvl = vector<vector<long long>>;

ll MOD = 1e9 + 7;
const int INF = int(1e9);

struct Rect {
	ll x1 = 0, y1 = 0, x2 = 0, y2 = 0;
	ll area() { return (x2 - x1) * (y2 - y1); }
};

Rect intersect(Rect p, Rect q) {
	Rect inter;
	inter.x1 = max(p.x1, q.x1);
	inter.y1 = max(p.y1, q.y1);
	inter.x2 = min(p.x2, q.x2);
	inter.y2 = min(p.y2, q.y2);
	if (inter.x1 >= inter.x2 || inter.y1 >= inter.y2) {
		Rect empty;
		return empty;
	}
	return inter;
}

bool iscovered(int x, int y, int x1, int y1, int x2, int y2) {
	return (x <= x2 && x >= x1 && y <= y2 && y >= y1);
}

bool isPrime(int n) {
	if (n == 2) return true;
	for(int i = 2; i * i <= n; i++) {
		if (n % i == 0) return false;
	}
	return true;
}

unsigned long long factorial(int n) {
    const unsigned int M = MOD;
    unsigned long long f = 1;
    for (int i = 1; i <= n; i++)
        f = (f*i) % M;
    return f;
}

void solve() {
	string s;
	cin >> s;
	cout << 3 << endl;
	cout << "L 2\n";
	cout << "R " << sz(s) + 1 << endl;
	cout << "R " << 2*sz(s) - 2 << endl;

}
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	// ll t; cin >> t;
	// while (t--)
		solve();
	return 0;
}


#include <bits/stdc++.h>

using namespace std;

#define REP(i,a,b) for (int i = a; i <= b; i++)
#define REP_REV(i,a,b) for (int i = a; i >= b; i--)
#define debug(x) cerr << #x << " is " << x << endl;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).end()
#define sz(x) (int)(x).size()

#define pb push_back
#define rsz resize
#define f first
#define s second
#define mp make_pair

using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vc = vector<char>;
using ull = unsigned long long ;
using pi = pair<int, int>;
using vl = vector<long long>;
using pl = pair<long long, long long>;
using vpl = vector<pair<long long, long long>>;
using msl = map<string, long long>;
using vvl = vector<vector<long long>>;

ll MOD = 1e9 + 7;
const int INF = int(1e9);

struct Rect {
	ll x1 = 0, y1 = 0, x2 = 0, y2 = 0;
	ll area() { return (x2 - x1) * (y2 - y1); }
};

Rect intersect(Rect p, Rect q) {
	Rect inter;
	inter.x1 = max(p.x1, q.x1);
	inter.y1 = max(p.y1, q.y1);
	inter.x2 = min(p.x2, q.x2);
	inter.y2 = min(p.y2, q.y2);
	if (inter.x1 >= inter.x2 || inter.y1 >= inter.y2) {
		Rect empty;
		return empty;
	}
	return inter;
}

bool iscovered(int x, int y, int x1, int y1, int x2, int y2) {
	return (x <= x2 && x >= x1 && y <= y2 && y >= y1);
}

bool isPrime(int n) {
	if (n == 2) return true;
	for(int i = 2; i * i <= n; i++) {
		if (n % i == 0) return false;
	}
	return true;
}

unsigned long long factorial(int n) {
    const unsigned int M = MOD;
    unsigned long long f = 1;
    for (int i = 1; i <= n; i++)
        f = (f*i) % M;
    return f;
}

void solve() {
	string s;
	cin >> s;
	cout << 3 << endl;
	cout << "L 2\n";
	cout << "R " << sz(s) + 1 << endl;
	cout << "R " << 2*sz(s) - 1 << endl;

}
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	// ll t; cin >> t;
	// while (t--)
		solve();
	return 0;
}


#include <bits/stdc++.h>

using namespace std;

#define REP(i,a,b) for (int i = a; i <= b; i++)
#define REP_REV(i,a,b) for (int i = a; i >= b; i--)
#define debug(x) cerr << #x << " is " << x << endl;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).end()
#define sz(x) (int)(x).size()

#define pb push_back
#define rsz resize
#define f first
#define s second
#define mp make_pair

using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vc = vector<char>;
using ull = unsigned long long ;
using pi = pair<int, int>;
using vl = vector<long long>;
using pl = pair<long long, long long>;
using vpl = vector<pair<long long, long long>>;
using msl = map<string, long long>;
using vvl = vector<vector<long long>>;

ll MOD = 1e9 + 7;
const int INF = int(1e9);

struct Rect {
	ll x1 = 0, y1 = 0, x2 = 0, y2 = 0;
	ll area() { return (x2 - x1) * (y2 - y1); }
};

Rect intersect(Rect p, Rect q) {
	Rect inter;
	inter.x1 = max(p.x1, q.x1);
	inter.y1 = max(p.y1, q.y1);
	inter.x2 = min(p.x2, q.x2);
	inter.y2 = min(p.y2, q.y2);
	if (inter.x1 >= inter.x2 || inter.y1 >= inter.y2) {
		Rect empty;
		return empty;
	}
	return inter;
}

bool iscovered(int x, int y, int x1, int y1, int x2, int y2) {
	return (x <= x2 && x >= x1 && y <= y2 && y >= y1);
}

bool isPrime(int n) {
	if (n == 2) return true;
	for(int i = 2; i * i <= n; i++) {
		if (n % i == 0) return false;
	}
	return true;
}

unsigned long long factorial(int n) {
    const unsigned int M = MOD;
    unsigned long long f = 1;
    for (int i = 1; i <= n; i++)
        f = (f*i) % M;
    return f;
}

void solve() {
	string s;
	cin >> s;
	cout << 3 << endl;
	cout << "L 2\n";
	cout << "R " << 2 << endl;
	cout << "R " << 2*sz(s) - 1 << endl;

}
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	// ll t; cin >> t;
	// while (t--)
		solve();
	return 0;
}


#include<bits/stdc++.h>
#define forOneToN(i, n)         for(int i = 1; i <= n; i++)
#define forZeroToNminus(i, n)   for(int i = 0; i < n; i++)
#define forNToOne(i, n)         for(int i = n; i >= 1; i--)
#define forNminusToZero(i, n)   for(int i = n-1; i >= 0; i--)

#define makepair                make_pair
#define pushback                push_back

//Test Code
#define test                    cout <<"I am here" << endl;

using namespace std;
void fastInputOutput(){ios_base::sync_with_stdio(false);cin.tie(NULL);}

typedef long long ll;
typedef double db;

typedef vector<int>                                                             vii;
typedef vector<long long>                                                       vll;
typedef vector< pair<int, int> >                                                vpii;
typedef vector< pair<long long, long long> >                                    vpll;
typedef vector< pair<long long, int> >                                          vpli;
typedef vector< pair<int, long long> >                                          vpil;
typedef pair<int, int>                                                          pii;
typedef pair<long long, long long>                                              pll;
typedef pair<long long, int>                                                    pli;
typedef pair<int, long long>                                                    pil;
typedef map<int, int>                                                           mii;
typedef map<long long, long long>                                               mll;
typedef map<long long, int>                                                     mli;
typedef map<int, long long>                                                     mil;
typedef multimap<int, int>                                                      mmii;
typedef multimap<long long, int>                                                mmli;
typedef multimap<int, long long>                                                mmil;
typedef multimap<long long, long long>                                          mmll;
typedef set<int>                                                                si;
typedef set<long long>                                                          sll;
typedef multiset<int>                                                           msi;
typedef multiset<long long>                                                     msll;
typedef set<long long, greater<long long> >                                     slld;
typedef set<int, greater<int> >                                                 sid;
typedef multiset<int, greater<int> >                                            msid;
typedef multiset<long long, greater<long long> >                                mslld;
typedef stack<long long>                                                        stll;
typedef stack<int>                                                              sti;
typedef queue<long long>                                                        qll;
typedef queue<int>                                                              qi;
typedef priority_queue<long long>                                               maxpqll;
typedef priority_queue<int>                                                     maxpqi;
typedef priority_queue<long long, vector<long long>, greater<long long> >       minpqll;
typedef priority_queue<int, vector<int>, greater<int> >                         minmpqi;
typedef priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> Minpairpq;

ll GCD(ll a, ll b){ll gcd, g;g = __gcd(a, b);return g;}
ll gcd(ll a, ll b){if(b == 0){return a;}else{return gcd(b, a%b);}}
ll extended_gcd(ll a, ll b, ll *x, ll *y){if(a == 0){*x = 0;*y = 1;return b;}ll x1, y1;ll d = extended_gcd(b%a, a, &x1, &y1);*x = y1-(b/a)*x1;*y = x1;return d;}
ll LCM(ll a, ll b){ll gcd, g;g = __gcd(a, b);return (a/g)*b;}
ll PowFun(ll base, ll power){ll ans = 1;for(int i = 1; i <= power; i++){ans *= base;}return ans;}
/*This is better power function here used binary exponentiation*/
ll MadeFun(ll b, ll p){if(p == 0){return 1;}else if(p%2 == 0){return MadeFun(b*b, p/2);}else{return b*MadeFun(b*b, (p-1)/2);}}
ll Set(ll n, ll pos){return n = n|(1<<pos);}
ll Reset(ll n, ll pos){return n = n& ~(1<<pos);}
bool Check(ll n, ll pos){return (bool)(n&(1<<pos));}

const ll INF_LONG = 1LL<<61;
const unsigned int inf_int = 1<<31;
const ll mod = 1e9+7;
double phi = acos(-1);

//own compare function structure for set
struct cmp_for_set_and_Semilar
{
    bool operator()(pair<int, int> a, pair<int, int> b)
    {
        return (a.first > b.first);
    }
};
//own compare function structure for vector pair
bool cmp(const pair<int, int> &a, const pair<int, int> &b)
{
    if(a.first != b.first)
    {
        return a.first < b.first;
    }
    return a.second > b.second;
}

long long BinaryEx(long long a, long long b)
{
    long long ans = 1;
    while(b)
    {
        if(b%2 == 0)
        {
            a = (a*a);
            b /= 2;
        }
        else
        {
            ans = (ans*a);
            b--;
        }
    }
    return ans;
}

long long mod_inverse(long long a)
{
    return BinaryEx(a, mod-2);
}

vector<pair<int, int>>vp;
int mark[3000005] = {1};
int index[3][3000005] = {};
int pos = 0;
int m = 0;
bool isSubsequence(string str1, string str2, int pos1, int pos2)
{
    //int m = str1.size();
    int n = str2.size();
    int j = pos1;
    int t1 = 0, t2 = 0;
    for(int i = pos2; i < n && j < m; i++)
    {
        if(str1[j] == str2[i] && j < m)
        {
            //j++;
            //vp.push_back(make_pair(j, i));
            pos++;
            index[0][pos] = j; index[1][pos] = i;
            //pos++;
            j++;
            //pos1 = j; pos2 = i;
            //t1 = j-1; t2 = i-1;
        }
    }
    //pos1 = t1; pos2 = t2;
    return (j == m);
}
void solve()
{
    string str; cin >> str;
    string st = "";
    char c = str[1];
    for(int i = 1; i < str.size()-1; i++)
    {
        st += str[i];
    }
    reverse(st.begin(), st.end());
    for(int i = 0; i < st.size(); i++)
    {
        str += st[i];
    }
    vector<pair<char, int>>vp;
    vp.push_back(make_pair('L', 2));
    st = "";
    int pos = 0;
    bool ok = false;
    for(int i = 1; i < str.size()-1; i++)
    {
        st += str[i];
        if(c == str[i] && ok == false)
        {
            ok = true;
            pos = i+1;
        }
    }
    reverse(st.begin(), st.end());
    vp.push_back(make_pair('R', 2));
    vp.push_back(make_pair('R', pos));
    cout << vp.size() << endl;
    for(int i = 0; i < vp.size(); i++)
    {
        cout << vp[i].first << " " << vp[i].second << endl;
    }
    cout << c << st << str << endl;
}
int main()
{
    fastInputOutput();
    //int t; cin >> t;while(t--) solve();
    solve();
    return 0;
}


#include<bits/stdc++.h>
#define forOneToN(i, n)         for(int i = 1; i <= n; i++)
#define forZeroToNminus(i, n)   for(int i = 0; i < n; i++)
#define forNToOne(i, n)         for(int i = n; i >= 1; i--)
#define forNminusToZero(i, n)   for(int i = n-1; i >= 0; i--)

#define makepair                make_pair
#define pushback                push_back

//Test Code
#define test                    cout <<"I am here" << endl;

using namespace std;
void fastInputOutput(){ios_base::sync_with_stdio(false);cin.tie(NULL);}

typedef long long ll;
typedef double db;

typedef vector<int>                                                             vii;
typedef vector<long long>                                                       vll;
typedef vector< pair<int, int> >                                                vpii;
typedef vector< pair<long long, long long> >                                    vpll;
typedef vector< pair<long long, int> >                                          vpli;
typedef vector< pair<int, long long> >                                          vpil;
typedef pair<int, int>                                                          pii;
typedef pair<long long, long long>                                              pll;
typedef pair<long long, int>                                                    pli;
typedef pair<int, long long>                                                    pil;
typedef map<int, int>                                                           mii;
typedef map<long long, long long>                                               mll;
typedef map<long long, int>                                                     mli;
typedef map<int, long long>                                                     mil;
typedef multimap<int, int>                                                      mmii;
typedef multimap<long long, int>                                                mmli;
typedef multimap<int, long long>                                                mmil;
typedef multimap<long long, long long>                                          mmll;
typedef set<int>                                                                si;
typedef set<long long>                                                          sll;
typedef multiset<int>                                                           msi;
typedef multiset<long long>                                                     msll;
typedef set<long long, greater<long long> >                                     slld;
typedef set<int, greater<int> >                                                 sid;
typedef multiset<int, greater<int> >                                            msid;
typedef multiset<long long, greater<long long> >                                mslld;
typedef stack<long long>                                                        stll;
typedef stack<int>                                                              sti;
typedef queue<long long>                                                        qll;
typedef queue<int>                                                              qi;
typedef priority_queue<long long>                                               maxpqll;
typedef priority_queue<int>                                                     maxpqi;
typedef priority_queue<long long, vector<long long>, greater<long long> >       minpqll;
typedef priority_queue<int, vector<int>, greater<int> >                         minmpqi;
typedef priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> Minpairpq;

ll GCD(ll a, ll b){ll gcd, g;g = __gcd(a, b);return g;}
ll gcd(ll a, ll b){if(b == 0){return a;}else{return gcd(b, a%b);}}
ll extended_gcd(ll a, ll b, ll *x, ll *y){if(a == 0){*x = 0;*y = 1;return b;}ll x1, y1;ll d = extended_gcd(b%a, a, &x1, &y1);*x = y1-(b/a)*x1;*y = x1;return d;}
ll LCM(ll a, ll b){ll gcd, g;g = __gcd(a, b);return (a/g)*b;}
ll PowFun(ll base, ll power){ll ans = 1;for(int i = 1; i <= power; i++){ans *= base;}return ans;}
/*This is better power function here used binary exponentiation*/
ll MadeFun(ll b, ll p){if(p == 0){return 1;}else if(p%2 == 0){return MadeFun(b*b, p/2);}else{return b*MadeFun(b*b, (p-1)/2);}}
ll Set(ll n, ll pos){return n = n|(1<<pos);}
ll Reset(ll n, ll pos){return n = n& ~(1<<pos);}
bool Check(ll n, ll pos){return (bool)(n&(1<<pos));}

const ll INF_LONG = 1LL<<61;
const unsigned int inf_int = 1<<31;
const ll mod = 1e9+7;
double phi = acos(-1);

//own compare function structure for set
struct cmp_for_set_and_Semilar
{
    bool operator()(pair<int, int> a, pair<int, int> b)
    {
        return (a.first > b.first);
    }
};
//own compare function structure for vector pair
bool cmp(const pair<int, int> &a, const pair<int, int> &b)
{
    if(a.first != b.first)
    {
        return a.first < b.first;
    }
    return a.second > b.second;
}

long long BinaryEx(long long a, long long b)
{
    long long ans = 1;
    while(b)
    {
        if(b%2 == 0)
        {
            a = (a*a);
            b /= 2;
        }
        else
        {
            ans = (ans*a);
            b--;
        }
    }
    return ans;
}

long long mod_inverse(long long a)
{
    return BinaryEx(a, mod-2);
}

vector<pair<int, int>>vp;
int mark[3000005] = {1};
int index[3][3000005] = {};
int pos = 0;
int m = 0;
bool isSubsequence(string str1, string str2, int pos1, int pos2)
{
    //int m = str1.size();
    int n = str2.size();
    int j = pos1;
    int t1 = 0, t2 = 0;
    for(int i = pos2; i < n && j < m; i++)
    {
        if(str1[j] == str2[i] && j < m)
        {
            //j++;
            //vp.push_back(make_pair(j, i));
            pos++;
            index[0][pos] = j; index[1][pos] = i;
            //pos++;
            j++;
            //pos1 = j; pos2 = i;
            //t1 = j-1; t2 = i-1;
        }
    }
    //pos1 = t1; pos2 = t2;
    return (j == m);
}
void solve()
{
    string str; cin >> str;
    string st = "";
    char c = str[1];
    for(int i = 1; i < str.size()-1; i++)
    {
        st += str[i];
    }
    reverse(st.begin(), st.end());
    for(int i = 0; i < st.size(); i++)
    {
        str += st[i];
    }
    vector<pair<char, int>>vp;
    vp.push_back(make_pair('L', 2));
    st = "";
    int pos = 0;
    bool ok = false;
    for(int i = 1; i < str.size()-1; i++)
    {
        st += str[i];
        if(c == str[i] && ok == false)
        {
            ok = true;
            pos = i+1;
        }
    }
    reverse(st.begin(), st.end());
    vp.push_back(make_pair('R', 2));
    vp.push_back(make_pair('R', pos));
    cout << vp.size() << endl;
    for(int i = 0; i < vp.size(); i++)
    {
        cout << vp[i].first << " " << vp[i].second << endl;
    }
    //cout << c << st << str << endl;
}
int main()
{
    fastInputOutput();
    //int t; cin >> t;while(t--) solve();
    solve();
    return 0;
}


#include<bits/stdc++.h>
#define forOneToN(i, n)         for(int i = 1; i <= n; i++)
#define forZeroToNminus(i, n)   for(int i = 0; i < n; i++)
#define forNToOne(i, n)         for(int i = n; i >= 1; i--)
#define forNminusToZero(i, n)   for(int i = n-1; i >= 0; i--)

#define makepair                make_pair
#define pushback                push_back

//Test Code
#define test                    cout <<"I am here" << endl;

using namespace std;
void fastInputOutput(){ios_base::sync_with_stdio(false);cin.tie(NULL);}

typedef long long ll;
typedef double db;

typedef vector<int>                                                             vii;
typedef vector<long long>                                                       vll;
typedef vector< pair<int, int> >                                                vpii;
typedef vector< pair<long long, long long> >                                    vpll;
typedef vector< pair<long long, int> >                                          vpli;
typedef vector< pair<int, long long> >                                          vpil;
typedef pair<int, int>                                                          pii;
typedef pair<long long, long long>                                              pll;
typedef pair<long long, int>                                                    pli;
typedef pair<int, long long>                                                    pil;
typedef map<int, int>                                                           mii;
typedef map<long long, long long>                                               mll;
typedef map<long long, int>                                                     mli;
typedef map<int, long long>                                                     mil;
typedef multimap<int, int>                                                      mmii;
typedef multimap<long long, int>                                                mmli;
typedef multimap<int, long long>                                                mmil;
typedef multimap<long long, long long>                                          mmll;
typedef set<int>                                                                si;
typedef set<long long>                                                          sll;
typedef multiset<int>                                                           msi;
typedef multiset<long long>                                                     msll;
typedef set<long long, greater<long long> >                                     slld;
typedef set<int, greater<int> >                                                 sid;
typedef multiset<int, greater<int> >                                            msid;
typedef multiset<long long, greater<long long> >                                mslld;
typedef stack<long long>                                                        stll;
typedef stack<int>                                                              sti;
typedef queue<long long>                                                        qll;
typedef queue<int>                                                              qi;
typedef priority_queue<long long>                                               maxpqll;
typedef priority_queue<int>                                                     maxpqi;
typedef priority_queue<long long, vector<long long>, greater<long long> >       minpqll;
typedef priority_queue<int, vector<int>, greater<int> >                         minmpqi;
typedef priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> Minpairpq;

ll GCD(ll a, ll b){ll gcd, g;g = __gcd(a, b);return g;}
ll gcd(ll a, ll b){if(b == 0){return a;}else{return gcd(b, a%b);}}
ll extended_gcd(ll a, ll b, ll *x, ll *y){if(a == 0){*x = 0;*y = 1;return b;}ll x1, y1;ll d = extended_gcd(b%a, a, &x1, &y1);*x = y1-(b/a)*x1;*y = x1;return d;}
ll LCM(ll a, ll b){ll gcd, g;g = __gcd(a, b);return (a/g)*b;}
ll PowFun(ll base, ll power){ll ans = 1;for(int i = 1; i <= power; i++){ans *= base;}return ans;}
/*This is better power function here used binary exponentiation*/
ll MadeFun(ll b, ll p){if(p == 0){return 1;}else if(p%2 == 0){return MadeFun(b*b, p/2);}else{return b*MadeFun(b*b, (p-1)/2);}}
ll Set(ll n, ll pos){return n = n|(1<<pos);}
ll Reset(ll n, ll pos){return n = n& ~(1<<pos);}
bool Check(ll n, ll pos){return (bool)(n&(1<<pos));}

const ll INF_LONG = 1LL<<61;
const unsigned int inf_int = 1<<31;
const ll mod = 1e9+7;
double phi = acos(-1);

//own compare function structure for set
struct cmp_for_set_and_Semilar
{
    bool operator()(pair<int, int> a, pair<int, int> b)
    {
        return (a.first > b.first);
    }
};
//own compare function structure for vector pair
bool cmp(const pair<int, int> &a, const pair<int, int> &b)
{
    if(a.first != b.first)
    {
        return a.first < b.first;
    }
    return a.second > b.second;
}

long long BinaryEx(long long a, long long b)
{
    long long ans = 1;
    while(b)
    {
        if(b%2 == 0)
        {
            a = (a*a);
            b /= 2;
        }
        else
        {
            ans = (ans*a);
            b--;
        }
    }
    return ans;
}

long long mod_inverse(long long a)
{
    return BinaryEx(a, mod-2);
}

vector<pair<int, int>>vp;
int mark[3000005] = {1};
int index[3][3000005] = {};
int pos = 0;
int m = 0;
bool isSubsequence(string str1, string str2, int pos1, int pos2)
{
    //int m = str1.size();
    int n = str2.size();
    int j = pos1;
    int t1 = 0, t2 = 0;
    for(int i = pos2; i < n && j < m; i++)
    {
        if(str1[j] == str2[i] && j < m)
        {
            //j++;
            //vp.push_back(make_pair(j, i));
            pos++;
            index[0][pos] = j; index[1][pos] = i;
            //pos++;
            j++;
            //pos1 = j; pos2 = i;
            //t1 = j-1; t2 = i-1;
        }
    }
    //pos1 = t1; pos2 = t2;
    return (j == m);
}
void solve()
{
    string str; cin >> str;
    int n = str.size();
    cout << 3 << endl;
    cout << "R 2" << endl;
    cout << "L " << n+(n-2)-1 << endl;
    cout << "L " << n+(n-2) << endl;
}
int main()
{
    fastInputOutput();
    //int t; cin >> t;while(t--) solve();
    solve();
    return 0;
}


#include<bits/stdc++.h>
#define forOneToN(i, n)         for(int i = 1; i <= n; i++)
#define forZeroToNminus(i, n)   for(int i = 0; i < n; i++)
#define forNToOne(i, n)         for(int i = n; i >= 1; i--)
#define forNminusToZero(i, n)   for(int i = n-1; i >= 0; i--)

#define makepair                make_pair
#define pushback                push_back

//Test Code
#define test                    cout <<"I am here" << endl;

using namespace std;
void fastInputOutput(){ios_base::sync_with_stdio(false);cin.tie(NULL);}

typedef long long ll;
typedef double db;

typedef vector<int>                                                             vii;
typedef vector<long long>                                                       vll;
typedef vector< pair<int, int> >                                                vpii;
typedef vector< pair<long long, long long> >                                    vpll;
typedef vector< pair<long long, int> >                                          vpli;
typedef vector< pair<int, long long> >                                          vpil;
typedef pair<int, int>                                                          pii;
typedef pair<long long, long long>                                              pll;
typedef pair<long long, int>                                                    pli;
typedef pair<int, long long>                                                    pil;
typedef map<int, int>                                                           mii;
typedef map<long long, long long>                                               mll;
typedef map<long long, int>                                                     mli;
typedef map<int, long long>                                                     mil;
typedef multimap<int, int>                                                      mmii;
typedef multimap<long long, int>                                                mmli;
typedef multimap<int, long long>                                                mmil;
typedef multimap<long long, long long>                                          mmll;
typedef set<int>                                                                si;
typedef set<long long>                                                          sll;
typedef multiset<int>                                                           msi;
typedef multiset<long long>                                                     msll;
typedef set<long long, greater<long long> >                                     slld;
typedef set<int, greater<int> >                                                 sid;
typedef multiset<int, greater<int> >                                            msid;
typedef multiset<long long, greater<long long> >                                mslld;
typedef stack<long long>                                                        stll;
typedef stack<int>                                                              sti;
typedef queue<long long>                                                        qll;
typedef queue<int>                                                              qi;
typedef priority_queue<long long>                                               maxpqll;
typedef priority_queue<int>                                                     maxpqi;
typedef priority_queue<long long, vector<long long>, greater<long long> >       minpqll;
typedef priority_queue<int, vector<int>, greater<int> >                         minmpqi;
typedef priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> Minpairpq;

ll GCD(ll a, ll b){ll gcd, g;g = __gcd(a, b);return g;}
ll gcd(ll a, ll b){if(b == 0){return a;}else{return gcd(b, a%b);}}
ll extended_gcd(ll a, ll b, ll *x, ll *y){if(a == 0){*x = 0;*y = 1;return b;}ll x1, y1;ll d = extended_gcd(b%a, a, &x1, &y1);*x = y1-(b/a)*x1;*y = x1;return d;}
ll LCM(ll a, ll b){ll gcd, g;g = __gcd(a, b);return (a/g)*b;}
ll PowFun(ll base, ll power){ll ans = 1;for(int i = 1; i <= power; i++){ans *= base;}return ans;}
/*This is better power function here used binary exponentiation*/
ll MadeFun(ll b, ll p){if(p == 0){return 1;}else if(p%2 == 0){return MadeFun(b*b, p/2);}else{return b*MadeFun(b*b, (p-1)/2);}}
ll Set(ll n, ll pos){return n = n|(1<<pos);}
ll Reset(ll n, ll pos){return n = n& ~(1<<pos);}
bool Check(ll n, ll pos){return (bool)(n&(1<<pos));}

const ll INF_LONG = 1LL<<61;
const unsigned int inf_int = 1<<31;
const ll mod = 1e9+7;
double phi = acos(-1);

//own compare function structure for set
struct cmp_for_set_and_Semilar
{
    bool operator()(pair<int, int> a, pair<int, int> b)
    {
        return (a.first > b.first);
    }
};
//own compare function structure for vector pair
bool cmp(const pair<int, int> &a, const pair<int, int> &b)
{
    if(a.first != b.first)
    {
        return a.first < b.first;
    }
    return a.second > b.second;
}

long long BinaryEx(long long a, long long b)
{
    long long ans = 1;
    while(b)
    {
        if(b%2 == 0)
        {
            a = (a*a);
            b /= 2;
        }
        else
        {
            ans = (ans*a);
            b--;
        }
    }
    return ans;
}

long long mod_inverse(long long a)
{
    return BinaryEx(a, mod-2);
}

vector<pair<int, int>>vp;
int mark[3000005] = {1};
int index[3][3000005] = {};
int pos = 0;
int m = 0;
bool isSubsequence(string str1, string str2, int pos1, int pos2)
{
    //int m = str1.size();
    int n = str2.size();
    int j = pos1;
    int t1 = 0, t2 = 0;
    for(int i = pos2; i < n && j < m; i++)
    {
        if(str1[j] == str2[i] && j < m)
        {
            //j++;
            //vp.push_back(make_pair(j, i));
            pos++;
            index[0][pos] = j; index[1][pos] = i;
            //pos++;
            j++;
            //pos1 = j; pos2 = i;
            //t1 = j-1; t2 = i-1;
        }
    }
    //pos1 = t1; pos2 = t2;
    return (j == m);
}
void solve()
{
    string str; cin >> str;
    string st = "";
    char c = str[1];
    for(int i = 1; i < str.size()-1; i++)
    {
        st += str[i];
    }
    reverse(st.begin(), st.end());
    for(int i = 0; i < st.size(); i++)
    {
        str += st[i];
    }
    vector<pair<char, int>>vp;
    vp.push_back(make_pair('R', 2));
    st = "";
    int pos = 0;
    bool ok = false;
    for(int i = 1; i < str.size()-1; i++)
    {
        st += str[i];
        if(c == str[i] && ok == false)
        {
            ok = true;
            pos = i+1;
        }
    }
    reverse(st.begin(), st.end());
    vp.push_back(make_pair('L', 2));
    vp.push_back(make_pair('L', pos));
    cout << vp.size() << endl;
    for(int i = 0; i < vp.size(); i++)
    {
        cout << vp[i].first << " " << vp[i].second << endl;
    }
    cout << c << st << str << endl;
}
int main()
{
    fastInputOutput();
    //int t; cin >> t;while(t--) solve();
    solve();
    return 0;
}