#pragma GCC optimize ( "O3" )
#pragma GCC optimize( "unroll-loops" )
#pragma GCC target ( "sse4.2,fma,avx2,popcnt,lzcnt,bmi2" )
#include <iostream>
#include <stdio.h>
#include <stdint.h>
#include <cassert>
using namespace std;
using ll = long long;

#define TYPE_OF( VAR ) remove_const<remove_reference<decltype( VAR )>::type >::type
#define UNTIE ios_base::sync_with_stdio( false ); cin.tie( nullptr )
#define CEXPR( LL , BOUND , VALUE ) constexpr LL BOUND = VALUE
#define CIN( LL , A ) LL A; cin >> A
#define ASSERT( A , MIN , MAX ) assert( ( MIN ) <= A && A <= ( MAX ) )
#define CIN_ASSERT( A , MIN , MAX ) CIN( TYPE_OF( MAX ) , A ); ASSERT( A , MIN , MAX )
#define FOR( VAR , INITIAL , FINAL_PLUS_ONE ) for( TYPE_OF( FINAL_PLUS_ONE ) VAR = INITIAL ; VAR < FINAL_PLUS_ONE ; VAR ++ )
#define REPEAT( HOW_MANY_TIMES ) FOR( VARIABLE_FOR_REPEAT , 0 , HOW_MANY_TIMES )
#define QUIT return 0
#define COUT( ANSWER ) cout << ( ANSWER ) << "\n"
#define RETURN( ANSWER ) COUT( ANSWER ); QUIT

int main()
{
  UNTIE;
  CEXPR( int , bound_N , 200000 );
  CIN_ASSERT( N , 2 , bound_N );
  CEXPR( ll , bound_Ai , 1000000000 );
  CEXPR( ll , P , 998244353 );
  ll A[2];
  CIN_ASSERT( A0 , 1 , bound_Ai );
  CIN_ASSERT( A1 , 1 , bound_Ai );
  A[0] = A0;
  A[1] = A1;
  ll answer = min( A0 , A1 ) % P;
  int i_prev = 1;
  int i_curr = 0;
  N -= 2;
  REPEAT( N ){
    ll& Ai_prev = A[i_prev];
    ll& Ai_curr = A[i_curr];
    CIN_ASSERT( Ai , 1 , bound_Ai );
    Ai_curr = Ai;
    ( answer *= min( Ai_prev , Ai_curr ) ) %= P ;
    swap( i_prev , i_curr );
  }
  RETURN( answer );
}