import java . util . * ; public class LittlePonyandCrystalMine {   public static void main ( String [ ] args ) {

import java . util . Scanner ;   public class Main {   public static void main ( String [ ] args ) {   int n ; Scanner sc = new Scanner ( System . in ) ; n = sc . nextInt ( ) ;   int l = n / 2 + 1 , r = n / 2 - 1 ;

import java . io . File ; import java . io . FileNotFoundException ; import java . io . IOException ; import java . io . PrintWriter ; import java . util . * ;   public class Main { public static void main ( String [ ] args ) throws FileNotFoundException { Scanner input = new Scanner ( System . in ) ; int n = input . nextInt ( ) ; char [ ] [ ] ans = new char [ n ] [ n ] ; for ( int i = 0 ; i < n ; i ++ ) { Arrays . fill ( ans [ i ] , ' * ' ) ; } int start = n / 2 , nowlen = 1 , nowstart = n / 2 ; int Dstart = 1 , Dnowlen = n - 2 , Dnowstart = 1 ; int len = 1 ; int Dlen = Dnowlen ; for ( int i = 0 ; i < n ; i ++ ) { if ( i <= ( n / 2 ) ) { while ( nowlen -- > 0 ) { ans [ i ] [ nowstart ] = ' D ' ; nowstart ++ ; } len += 2 ; nowlen = len ; nowstart = -- start ; } else { while ( Dnowlen -- > 0 ) { ans [ i ] [ Dnowstart ] = ' D ' ; Dnowstart ++ ; } Dlen -= 2 ; Dnowlen = Dlen ; Dnowstart = ++ Dstart ; } } for ( int i = 0 ; i < n ; i ++ ) { for ( int j = 0 ; j < n ; j ++ ) { System . out . print ( ans [ i ] [ j ] ) ; } System . out . println ( " " ) ; } }   }

import java . io . BufferedOutputStream ; import java . io . BufferedReader ; import java . io . IOException ; import java . io . InputStreamReader ; import java . util . Arrays ;   public class A454A {   public static void main ( String [ ] args ) throws IOException { A454A a = new A454A ( ) ; a . solve ( ) ; }   public void solve ( ) throws IOException { BufferedReader br = new BufferedReader ( new InputStreamReader ( System . in ) ) ; BufferedOutputStream bos = new BufferedOutputStream ( new BufferedOutputStream ( System . out ) ) ;   int n = Integer . parseInt ( br . readLine ( ) ) ;   for ( int i = 0 ; i < n / 2 ; i ++ ) { int nd = i * 2 + 1 ; char [ ] cad = new char [ nd ] ; Arrays . fill ( cad , ' D ' ) ; char [ ] cas = new char [ ( n - nd ) / 2 ] ; Arrays . fill ( cas , ' * ' ) ; bos . write ( String . valueOf ( cas ) . getBytes ( ) ) ; bos . write ( String . valueOf ( cad ) . getBytes ( ) ) ; bos . write ( String . valueOf ( cas ) . getBytes ( ) ) ; bos . write ( " \n " . getBytes ( ) ) ; }   char [ ] cad1 = new char [ n ] ; Arrays . fill ( cad1 , ' D ' ) ; bos . write ( String . valueOf ( cad1 ) . getBytes ( ) ) ; bos . write ( " \n " . getBytes ( ) ) ;   for ( int i = 0 ; i < n / 2 ; i ++ ) { int ns = i + 1 ; char [ ] cas = new char [ ns ] ; Arrays . fill ( cas , ' * ' ) ; char [ ] cad = new char [ n - ns * 2 ] ; Arrays . fill ( cad , ' D ' ) ;   bos . write ( String . valueOf ( cas ) . getBytes ( ) ) ; bos . write ( String . valueOf ( cad ) . getBytes ( ) ) ; bos . write ( String . valueOf ( cas ) . getBytes ( ) ) ; bos . write ( " \n " . getBytes ( ) ) ; }   bos . flush ( ) ; } }

import java . util . Scanner ;    public class Main { public static void main ( String [ ] args ) { Scanner sc = new Scanner ( System . in ) ; int n = sc . nextInt ( ) ; for ( int i = 0 ; i < n ; i ++ ) { for ( int j = 0 ; j < n ; j ++ ) { if ( i <= n / 2 ) { if ( j <= ( ( n / 2 ) + i ) && j >= ( ( n / 2 ) - i ) ) System . out . print ( " D " ) ; else System . out . print ( " * " ) ; } else { if ( j <= ( ( n / 2 ) + ( n - i - 1 ) ) && j >= ( ( n / 2 ) - ( n - i - 1 ) ) ) System . out . print ( " D " ) ; else System . out . print ( " * " ) ; } } System . out . println ( ) ; } } }

def romb ( n ) : final_list = [ ] m_l = [ ] for i in range ( n ) : m_l . append ( " * " ) mid = len ( m_l ) // 2 reached_first = False k = 0 for i in range ( n ) : if len ( m_l ) - 1 >= i + mid and not reached_first : m_l [ i + mid ] = " D " m_l [ mid - i ] = " D " final_list . append ( " " . join ( m_l ) ) if len ( m_l ) - 1 < i + mid : reached_first = True if reached_first : m_l [ - 1 - k ] = " * " m_l [ 0 + k ] = " * " k += 1 final_list . append ( " " . join ( m_l ) ) return " \n " . join ( final_list )     def main_function ( ) : n = int ( input ( ) ) return romb ( n )   print ( main_function ( ) ) NEW_LINE

import sys   def main ( ) : n = int ( sys . stdin . read ( ) . strip ( ) ) return [ ( ' D ' * i ) . center ( n , ' * ' ) for i in list ( range ( 1 , n + 1 , 2 ) ) + list ( range ( n - 2 , 0 , - 2 ) ) ]   print ( * main ( ) , sep = ' \n ' ) NEW_LINE

if __name__ == ' _ _ main _ _ ' : n = int ( input ( ) ) for i in range ( n ) : for j in range ( n ) : if min ( i , n - i - 1 ) + min ( j , n - j - 1 ) < n // 2 : print ( ' * ' , end = ' ' ) else : print ( ' D ' , end = ' ' ) print ( ) NEW_LINE

n = int ( input ( ) ) c = " * " * nx = 1 mid = Falsefor i in range ( n ) : if i == ( n - 1 ) / 2 : mid = True a = c [ : int ( ( n - x ) / 2 ) ] b = " D " * x print ( a + b + a ) if mid == True : x -= 2 else : x += 2 NEW_LINE


import javax . print . DocFlavor ; import java . io . * ; import java . net . Inet4Address ; import java . sql . ClientInfoStatus ; import java . util . * ;

import java . io . BufferedReader ; import java . io . IOException ; import java . io . InputStreamReader ; import java . util . HashSet ; import java . util . LinkedList ; import java . util . StringTokenizer ; import java . util . TreeSet ;   public class D { public static void main ( String [ ] args ) { FastScanner scanner = new FastScanner ( ) ; int n = scanner . nextInt ( ) ; TreeSet < Integer > set = new TreeSet < > ( ) ; int max = 0 ; for ( int i = 0 ; i < n * 2 ; i ++ ) { Integer x = scanner . nextInt ( ) ; if ( ! set . contains ( x ) ) { set . add ( x ) ; } else { set . remove ( x ) ; } max = Math . max ( max , set . size ( ) ) ; }   System . out . println ( max ) ; }   static class FastScanner { BufferedReader br ; StringTokenizer st ;   public FastScanner ( ) { br = new BufferedReader ( new InputStreamReader ( System . in ) ) ; }   String next ( ) { while ( st == null || ! st . hasMoreElements ( ) ) { try { st = new StringTokenizer ( br . readLine ( ) ) ; } catch ( IOException e ) { e . printStackTrace ( ) ; } } return st . nextToken ( ) ; }   int nextInt ( ) { return Integer . parseInt ( next ( ) ) ; }   long nextLong ( ) { return Long . parseLong ( next ( ) ) ; }   double nextDouble ( ) { return Double . parseDouble ( next ( ) ) ; }   String nextLine ( ) { String str = " " ; try { str = br . readLine ( ) ; } catch ( IOException e ) { e . printStackTrace ( ) ; } return str ; }   int [ ] nextArray ( int n ) { int [ ] arr = new int [ n ] ; for ( int i = 0 ; i < n ; i ++ ) { arr [ i ] = nextInt ( ) ; } return arr ; } } }

import java . io . * ; import java . util . HashSet ; import java . util . StringTokenizer ;

def main_function ( ) : n = int ( input ( ) ) socks = [ int ( i ) for i in input ( ) . split ( " ▁ " ) ] d = [ 0 for i in range ( n + 2 ) ] sum = 0 current_max = 0 for i in socks : if d [ i ] == 0 : d [ i ] = 1 sum += 1 else : d [ i ] = 0 sum -= 1 if sum > current_max : current_max = sum return current_max       print ( main_function ( ) ) NEW_LINE

num = int ( input ( ) ) arr = list ( map ( int , input ( ) . split ( ) ) )   table = set ( ) ct = 0 mx = 0 for sock in arr : if sock not in table : table . add ( sock ) ct += 1 else : ct -= 1   mx = max ( ct , mx )   print ( mx ) NEW_LINE

from collections import defaultdict   n = int ( input ( ) ) dic = defaultdict ( lambda : 0 ) socks = [ int ( i ) for i in input ( ) . split ( ) ] table = 0 Max = 0   for i in socks : if dic [ i ] == 1 : if Max < table : Max = table table -= 1 else : dic [ i ] = 1 table += 1   print ( Max ) NEW_LINE

from collections import Counterdef func ( ) : n = int ( input ( ) ) l = list ( map ( int , input ( ) . split ( ) ) ) k = { } m = 0 for i in l : if i in k : del k [ i ] else : k [ i ] = 1 if len ( k ) > m : m = len ( k ) print ( m ) t = 1 NEW_LINE

import sys   def main ( ) : _ , * l = map ( int , sys . stdin . read ( ) . strip ( ) . split ( ) ) s , c , m = set ( ) , 0 , 0 for i in l : if i in s : s . remove ( i ) if m < c : m = c c -= 1 else : s . add ( i ) ; c += 1 return m print ( main ( ) ) NEW_LINE


import java . util . ArrayList ; import java . util . Arrays ; import java . util . Scanner ;   public class Singleton_Pattern { public static void main ( String [ ] args ) { Scanner sc = new Scanner ( System . in ) ; long n = sc . nextLong ( ) ; long k = sc . nextLong ( ) ; long x = n / k ; if ( x % 2 == 0 ) System . out . println ( " NO " ) ; else System . out . println ( " YES " ) ; } }

import java . util . * ; public class contest18 { static Scanner scn = new Scanner ( System . in ) ; public static void main ( String [ ] args ) {

import java . io . BufferedReader ; import java . io . IOException ; import java . io . InputStreamReader ; import java . io . PrintWriter ; import java . util . * ;   public class Codeforces {   private static final Scanner sc = new Scanner ( System . in ) ; private static final BufferedReader br = new BufferedReader ( new InputStreamReader ( System . in ) ) ; private static final long MOD = ( long ) ( 1e9 + 7 ) ; private static PrintWriter out = new PrintWriter ( System . out ) ;   public static void solve ( int T ) throws IOException { long n = sc . nextLong ( ) ; long k = sc . nextLong ( ) ; long val = n / k ; if ( ( val & 1 ) == 1 ) { System . out . println ( " YES " ) ; } else { System . out . println ( " NO " ) ; } } public static void main ( String [ ] args ) throws IOException { int t = 1 ;

import java . util . Scanner ;   public class SashaAndSticks { public static void main ( String [ ] args ) { Scanner scanner = new Scanner ( System . in ) ; long n = scanner . nextLong ( ) ; long k = scanner . nextLong ( ) ;   System . out . println ( ( n / k ) % 2 == 1 ? " YES " : " NO " ) ; } }

n , k = map ( int , input ( ) . split ( ) ) print ( [ ' NO ' , ' YES ' ] [ ( n // k ) % 2 ] ) NEW_LINE

n , k = map ( int , input ( ) . split ( ) ) x = n // kif x % 2 == 0 : print ( " NO " ) else : print ( " YES " ) NEW_LINE

n , k = map ( int , input ( ) . split ( ) ) m = n // kif ( m % 2 == 0 ) : print ( " NO " ) else : print ( " YES " ) NEW_LINE

n , k = map ( int , input ( ) . split ( ) ) if ( ( n // k ) % 2 == 0 ) : print ( " NO " ) else : print ( " YES " ) NEW_LINE


import java . util . * ;   public final class domino { public static void main ( String Args [ ] ) { Scanner s = new Scanner ( System . in ) ; int m = s . nextInt ( ) ; int n = s . nextInt ( ) ; System . out . println ( ( m * n ) / 2 ) ; } }

import java . util . Scanner ;   public class CodeForces { public static void main ( String [ ] args ) { Scanner sc = new Scanner ( System . in ) ; int m = sc . nextInt ( ) ; int n = sc . nextInt ( ) ; System . out . println ( m * n / 2 ) ; } }

import java . util . * ;   public class Main {   public static void main ( String [ ] args ) {   Scanner sc = new Scanner ( System . in ) ;   int m = sc . nextInt ( ) ; int n = sc . nextInt ( ) ;   int size = m * n ; int max = size / 2 ; System . out . print ( max ) ;   } }

import java . util . * ; public class Main { public static void main ( String [ ] args ) { Scanner scan = new Scanner ( System . in ) ; int x = scan . nextInt ( ) ; int y = scan . nextInt ( ) ; System . out . println ( ( x * y ) / 2 ) ; } }

import java . util . * ;   public class Main {   public static void main ( String [ ] args ) { Scanner scanner = new Scanner ( System . in ) ; int n = scanner . nextInt ( ) ; int k = scanner . nextInt ( ) ; System . out . println ( ( n * k ) / 2 ) ; }   }

a , b = [ int ( x ) for x in input ( ) . split ( ) ] print ( a * b // 2 ) NEW_LINE

x , y = map ( int , input ( ) . split ( ) ) erg = ( ( x ) * ( y ) ) // 2 print ( erg ) NEW_LINE

n , m = map ( int , input ( ) . split ( ) ) k = 0 k += ( m // 2 ) * nk += ( m % 2 ) * ( n // 2 ) print ( k ) NEW_LINE

a , b = map ( int , input ( ) . split ( ) ) c = ( a * b ) // 2 print ( c ) NEW_LINE


import java . io . * ; import java . util . * ;   public class A { public static void main ( String [ ] args ) { Scanner sc = new Scanner ( System . in ) ; int n = sc . nextInt ( ) ; int arr [ ] = new int [ n ] ; for ( int i = 0 ; i < n ; i ++ ) { arr [ i ] = sc . nextInt ( ) ; } for ( int i = 0 ; i < n ; i ++ ) { int res = 0 ; for ( int j = 0 ; j < n ; j ++ ) { if ( arr [ j ] > arr [ i ] ) { res ++ ; } } System . out . print ( ( res + 1 ) + " ▁ " ) ; } } }

import java . util . * ; public class GukiZandContest {   public static void main ( String [ ] args ) {

import java . util . * ; import java . io . * ;   public class A { public static void main ( String [ ] args ) { InputStream inputStream = System . in ; OutputStream outputStream = System . out ; InputReader in = new InputReader ( inputStream ) ; PrintWriter out = new PrintWriter ( outputStream ) ; Task solver = new Task ( ) ; solver . solve ( 1 , in , out ) ; out . close ( ) ; }   static class Task { public void solve ( int testNumber , InputReader in , PrintWriter out ) { int N = in . nextInt ( ) ; int [ ] arr = new int [ N ] ; for ( int i = 0 ; i < arr . length ; i ++ ) arr [ i ] = in . nextInt ( ) ; List < Integer > sort = new ArrayList ( ) ; for ( int i : arr ) sort . add ( i ) ; Collections . sort ( sort , Collections . reverseOrder ( ) ) ; StringBuilder sb = new StringBuilder ( ) ;   for ( int i = 0 ; i < arr . length ; i ++ ) { int check = arr [ i ] ; for ( int j = 0 ; j < arr . length ; j ++ ) { if ( sort . get ( j ) == check ) { sb . append ( j + 1 + " ▁ " ) ; break ; } } } out . println ( sb . toString ( ) ) ; } }

import java . io . File ; import java . io . FileNotFoundException ; import java . io . IOException ; import java . io . PrintWriter ; import java . util . * ;   public class Main { public static void main ( String [ ] args ) throws FileNotFoundException { Scanner input = new Scanner ( System . in ) ; int n = input . nextInt ( ) ; int a [ ] = new int [ n ] ; for ( int i = 0 ; i < n ; i ++ ) { a [ i ] = input . nextInt ( ) ; } for ( int i = 0 ; i < n ; i ++ ) { int count = 0 ; for ( int j = 0 ; j < n ; j ++ ) { if ( a [ j ] > a [ i ] ) count ++ ; } System . out . print ( ( count + 1 ) + " ▁ " ) ; } System . out . println ( " " ) ; }     }

import java . util . Arrays ; import java . util . Scanner ;   public class Bai4 { public static void main ( String [ ] agrs ) { Scanner sc = new Scanner ( System . in ) ; int n = sc . nextInt ( ) ; int [ ] score = new int [ n ] ;   for ( int i = 0 ; i < n ; i ++ ) { score [ i ] = sc . nextInt ( ) ; }   int [ ] score_sorted = score . clone ( ) ; Arrays . sort ( score_sorted ) ;   for ( int i = 0 ; i < n ; i ++ ) { int s = 1 ; for ( int j = 0 ; j < n ; j ++ ) { if ( score [ i ] < score_sorted [ j ] ) { s ++ ; } } System . out . print ( s + " ▁ " ) ; } } }

n = input ( ) l = list ( map ( int , input ( ) . split ( ) ) ) for x in l : print ( sorted ( l ) [ : : - 1 ] . index ( x ) + 1 ) NEW_LINE

num = int ( input ( ) ) arr = list ( map ( int , input ( ) . split ( ) ) ) ct = 1 ln = len ( set ( arr ) ) arr = [ i * 3000 for i in arr ] while ln > 0 : mx = max ( arr ) add = arr . count ( mx ) arr = [ ct if i == mx else i for i in arr ] ct += add ln -= 1   print ( * arr )                     NEW_LINE

n = int ( input ( ) ) st = list ( map ( int , input ( ) . strip ( ) . split ( ) ) )   studs = [ None ] + st   ranks = [ ]   for i in range ( 1 , len ( studs ) ) : above = 0 for j in range ( 1 , len ( studs ) ) : if studs [ j ] > studs [ i ] : above += 1   ranks . append ( above + 1 )   print ( ' ▁ ' . join ( map ( str , ranks ) ) ) NEW_LINE

n = int ( input ( ) ) lst = [ int ( i ) for i in input ( ) . split ( ) ] exp = sorted ( lst , reverse = True )   for i in lst : print ( exp . index ( i ) + 1 , end = ' ▁ ' ) NEW_LINE

n = int ( input ( ) ) arr = list ( map ( int , input ( ) . split ( ) ) ) brr = sorted ( arr , reverse = True ) for i in range ( n ) : print ( brr . index ( arr [ i ] ) + 1 , end = " ▁ " ) NEW_LINE


import java . io . File ; import java . io . FileNotFoundException ; import java . io . IOException ; import java . io . PrintWriter ; import java . util . * ;   public class Main { public static void main ( String [ ] args ) { Scanner input = new Scanner ( System . in ) ; int n = input . nextInt ( ) ; for ( int i = 0 ; i < n ; i ++ ) { String s = input . next ( ) ; int a = input . nextInt ( ) ; int b = input . nextInt ( ) ; if ( a >= 2400 && b - a > 0 ) { System . out . println ( " YES " ) ; return ; } } System . out . println ( " NO " ) ; } }

import java . io . * ; import java . util . Collection ; import java . util . HashSet ; import java . util . Iterator ; import java . util . StringTokenizer ;   public class A681A {   static BufferedReader br = new BufferedReader ( new InputStreamReader ( System . in ) ) ; static PrintWriter pw = new PrintWriter ( new OutputStreamWriter ( System . out ) ) ; static StringTokenizer st ;   public static void main ( String [ ] args ) throws IOException { int n = Integer . parseInt ( br . readLine ( ) ) ; boolean found = false ;   for ( int i = 0 ; i < n ; i ++ ) { String [ ] sl = br . readLine ( ) . split ( " ▁ " ) ;   String handle = sl [ 0 ] ; int bs = Integer . parseInt ( sl [ 1 ] ) ; int as = Integer . parseInt ( sl [ 2 ] ) ;   if ( bs >= 2400 && as > bs ) { prln ( " YES " ) ; found = true ; break ; } }   if ( ! found ) { prln ( " NO " ) ; }   flush ( ) ; close ( ) ; }   static String next ( ) throws IOException { while ( st == null || ! st . hasMoreTokens ( ) ) st = new StringTokenizer ( br . readLine ( ) . trim ( ) ) ; return st . nextToken ( ) ; }   static int readInt ( ) throws IOException { return Integer . parseInt ( next ( ) ) ; }   static long readLong ( ) throws IOException { return Long . parseLong ( next ( ) ) ; }   static double readDouble ( ) throws IOException { return Double . parseDouble ( next ( ) ) ; }   static String readLine ( ) throws IOException { return br . readLine ( ) . trim ( ) ; }   static class Struct implements Comparable < Struct > { String name ; int value ;   Struct ( String name , int value ) { this . name = name ; this . value = value ; }   @ Override public int compareTo ( Struct o ) { if ( o . value == value ) return name . compareTo ( o . name ) ; return o . value - value ; } }

import java . util . Scanner ; public class P_sheet { public static void main ( String [ ] args ) { Scanner input = new Scanner ( System . in ) ; int n = input . nextInt ( ) ; String [ ] handle = new String [ n ] ; int [ ] before = new int [ n ] ; int [ ] after = new int [ n ] ; boolean x = false ; for ( int i = 0 ; i < n ; i ++ ) { handle [ i ] = input . next ( ) ; before [ i ] = input . nextInt ( ) ; after [ i ] = input . nextInt ( ) ; if ( before [ i ] >= 2400 && after [ i ] > before [ i ] ) { x = true ; break ; }   } if ( x == true ) System . out . println ( " YES " ) ; else System . out . println ( " NO " ) ; } }

import java . io . OutputStream ; import java . io . IOException ; import java . io . InputStream ; import java . io . PrintWriter ; import java . util . Scanner ;   public class Main { public static void main ( String [ ] args ) { InputStream inputStream = System . in ; OutputStream outputStream = System . out ; Scanner in = new Scanner ( inputStream ) ; PrintWriter out = new PrintWriter ( outputStream ) ; TaskA solver = new TaskA ( ) ; solver . solve ( 1 , in , out ) ; out . close ( ) ; }   static class TaskA { public void solve ( int testNumber , Scanner in , PrintWriter out ) { for ( int test = 0 ; test < testNumber ; test ++ ) { int x = in . nextInt ( ) ; boolean status = false ; for ( int i = 0 ; i < x ; i ++ ) { String s = in . next ( ) ; int before = in . nextInt ( ) ; int after = in . nextInt ( ) ;   if ( before >= 2400 ) { if ( before < after ) { status = true ; break ; } } } if ( status == false ) { out . println ( " NO " ) ; } else { out . println ( " YES " ) ; }   } }   } }

import java . util . Scanner ;   public class GoodContest { public static void main ( String [ ] args ) { Scanner scanner = new Scanner ( System . in ) ; int n = Integer . parseInt ( scanner . nextLine ( ) ) ;   for ( int i = 0 ; i < n ; i ++ ) { String [ ] s = scanner . nextLine ( ) . split ( " ▁ " ) ;   Integer pre = Integer . parseInt ( s [ 1 ] ) ; Integer post = Integer . parseInt ( s [ 2 ] ) ;   if ( pre >= 2400 && post > pre ) { System . out . println ( " YES " ) ; return ; } } System . out . println ( " NO " ) ; } }

num = int ( input ( ) ) name = [ ] before = [ ] after = [ ]   for i in range ( num ) : n , b , a = input ( ) . split ( ) name . append ( n ) before . append ( int ( b ) ) after . append ( int ( a ) )   result = list ( zip ( before , after ) ) li = [ list ( element ) for element in result ]   NEW_LINE

x = int ( input ( ) ) f = 0 for i in range ( x ) : s , n , m = input ( ) . split ( ) n = int ( n ) m = int ( m ) if ( m > n and m >= 2400 and n >= 2400 ) : f = 1 if f == 1 : print ( ' YES ' ) else : print ( ' NO ' )                   NEW_LINE

c = 0 for i in range ( int ( input ( ) ) ) : s = input ( ) a = s . split ( " ▁ " ) if ( int ( a [ 1 ] ) >= 2400 ) : if ( int ( a [ 2 ] ) > int ( a [ 1 ] ) ) : c = 1 breakif ( c == 0 ) : print ( " NO " ) else : print ( " YES " ) NEW_LINE

def insertion_sort ( l ) : for i in range ( len ( l ) ) : for j in ( range ( i ) ) : k = i - j if l [ k ] >= l [ k - 1 ] : l [ k - 1 ] , l [ k ] = l [ k ] , l [ k - 1 ] else : break return l       def selection_sort ( l ) : for i in range ( len ( l ) ) : min_ind = i min_val = l [ i ] for j in range ( i , len ( l ) ) : if min_val > l [ j ] : min_val = l [ j ] min_ind = j l [ i ] , l [ min_ind ] = l [ min_ind ] , l [ i ] return l     def bubble_sort ( l ) : for i in range ( len ( l ) - 1 ) : for j in range ( len ( l ) - 1 - i ) : if l [ j ] > l [ j + 1 ] : l [ j ] , l [ j + 1 ] = l [ j + 1 ] , l [ j ] return l     NEW_LINE


import java . io . IOException ; import java . io . InputStream ; import java . io . OutputStream ; import java . io . PrintWriter ; import java . math . BigInteger ; import java . util . * ;     public class Zuma {   public static void main ( String [ ] args ) {   InputStream inputStream = System . in ; OutputStream outputStream = System . out ; InputReader sc = new InputReader ( inputStream ) ; PrintWriter out = new PrintWriter ( outputStream ) ; Solver solver = new Solver ( ) ;

import java . io . BufferedReader ; import java . io . IOException ; import java . io . InputStreamReader ; import java . io . PrintWriter ; import java . util . ArrayList ; import java . util . Arrays ; import java . util . HashMap ; import java . util . Objects ; import java . util . Random ; import java . util . StringTokenizer ;   public class Solution { static final int maxn = 505 ; public static void main ( String [ ] args ) throws IOException { FastScanner fs = new FastScanner ( ) ; PrintWriter out = new PrintWriter ( System . out ) ; int tt = 1 ; while ( tt -- > 0 ) { int n = fs . nextInt ( ) ; int [ ] c = new int [ maxn ] ; for ( int i = 0 ; i < n ; i ++ ) c [ i ] = fs . nextInt ( ) ; int [ ] [ ] dp = new int [ maxn ] [ maxn ] ; for ( int len = 1 ; len <= n ; len ++ ) { for ( int i = 0 ; i + len - 1 < n ; i ++ ) { int end = i + len - 1 ; if ( len == 1 ) { dp [ i ] [ end ] = 1 ; } else { dp [ i ] [ end ] = 1 + dp [ i + 1 ] [ end ] ; if ( c [ i ] == c [ i + 1 ] ) { dp [ i ] [ end ] = Math . min ( dp [ i ] [ end ] , 1 + dp [ i + 2 ] [ end ] ) ; } for ( int j = i + 2 ; j <= end ; j ++ ) { if ( c [ i ] == c [ j ] ) { dp [ i ] [ end ] = Math . min ( dp [ i ] [ end ] , dp [ i + 1 ] [ j - 1 ] + dp [ j + 1 ] [ end ] ) ; } } } } } out . println ( dp [ 0 ] [ n - 1 ] ) ; } out . close ( ) ; } static final Random random = new Random ( ) ; static void ruffleSort ( int [ ] a ) { int n = a . length ;

import java . io . * ; import java . util . * ;   public class Main {   static int n ; static int [ ] arr ; static int [ ] [ ] dp ;   static int recur ( int L , int R ) { if ( L > R ) return 0 ; if ( L == R ) return 1 ; if ( dp [ L ] [ R ] != - 1 ) return dp [ L ] [ R ] ; int res = Integer . MAX_VALUE ; if ( arr [ L ] == arr [ R ] )

INF = int ( 1e9 )   n = int ( input ( ) ) s = list ( map ( int , input ( ) . split ( ) ) )   NEW_LINE

from sys import stdin , stdoutfor _ in range ( 1 ) : NEW_LINE

from sys import stdin , stdoutfor t in range ( 1 ) : NEW_LINE

n = int ( input ( ) ) t = tuple ( map ( int , input ( ) . split ( ) ) ) m = [ [ 1 ] * n for i in range ( n + 1 ) ] for d in range ( 2 , n + 1 ) : for i in range ( n - d + 1 ) : m [ d ] [ i ] = min ( m [ x ] [ i ] + m [ d - x ] [ i + x ] for x in range ( 1 , d ) ) if t [ i ] == t [ i + d - 1 ] : m [ d ] [ i ] = min ( m [ d ] [ i ] , m [ d - 2 ] [ i + 1 ] ) print ( m [ n ] [ 0 ] ) NEW_LINE


import java . util . * ; public class vesya_clender {   public static void main ( String [ ] args ) {

import java . util . * ; import java . io . * ;   public class _practise { public static void main ( String args [ ] ) { FastReader in = new FastReader ( ) ; PrintWriter so = new PrintWriter ( new BufferedWriter ( new OutputStreamWriter ( System . out ) ) ) ; int d = in . nextInt ( ) ; int n = in . nextInt ( ) ; int a [ ] = new int [ n ] ; int ans = 0 ; for ( int i = 0 ; i < n ; i ++ ) { a [ i ] = in . nextInt ( ) ; if ( i < n - 1 ) ans += d - a [ i ] ; } so . println ( ans ) ; so . flush ( ) ; } static class FastReader { BufferedReader br ; StringTokenizer st ; public FastReader ( ) { br = new BufferedReader ( new InputStreamReader ( System . in ) ) ; } String next ( ) { while ( st == null || ! st . hasMoreElements ( ) ) { try { st = new StringTokenizer ( br . readLine ( ) ) ; } catch ( IOException e ) { e . printStackTrace ( ) ; } } return st . nextToken ( ) ; } int nextInt ( ) { return Integer . parseInt ( next ( ) ) ; } long nextLong ( ) { return Long . parseLong ( next ( ) ) ; } double nextDouble ( ) { return Double . parseDouble ( next ( ) ) ; } int [ ] readIntArray ( int n ) { int a [ ] = new int [ n ] ; for ( int i = 0 ; i < n ; i ++ ) a [ i ] = nextInt ( ) ; return a ; } long [ ] readLongArray ( int n ) { long a [ ] = new long [ n ] ; for ( int i = 0 ; i < n ; i ++ ) a [ i ] = nextLong ( ) ; return a ; } String nextLine ( ) { String str = " " ; try { str = br . readLine ( ) ; } catch ( IOException e ) { e . printStackTrace ( ) ; } return str ; } } }

import java . util . * ; public class VasyasCalendar { public static void main ( String args [ ] ) { Scanner sc = new Scanner ( System . in ) ; int d = sc . nextInt ( ) ; int n = sc . nextInt ( ) ; int a [ ] = new int [ n ] ; for ( int i = 0 ; i < n ; i ++ ) a [ i ] = sc . nextInt ( ) ; int ans = 0 ; for ( int i = 0 ; i < n - 1 ; i ++ ) ans += ( d - a [ i ] ) ; System . out . println ( ans ) ; } }

import java . util . * ;   public class FoxAndDots { public static void main ( String [ ] args ) { Scanner sc = new Scanner ( System . in ) ; int d = sc . nextInt ( ) ; int n = sc . nextInt ( ) ; int [ ] a = new int [ n ] ; for ( int i = 0 ; i < n ; i ++ ) a [ i ] = sc . nextInt ( ) ; long c = 0 ; for ( int i = 1 ; i < n ; i ++ ) { if ( a [ i - 1 ] < d ) c += d - a [ i - 1 ] ; } System . out . println ( c ) ; } }

d = int ( input ( ) ) n = int ( input ( ) ) a = list ( map ( int , input ( ) . split ( ) ) ) count = 0 for i in range ( len ( a ) - 1 ) : count += d - a [ i ] print ( count ) NEW_LINE

def main ( ) : d = int ( input ( ) ) n = int ( input ( ) ) arr = list ( map ( int , input ( ) . split ( ) ) ) s1 = 0 for i in range ( n - 1 ) : s1 += ( d - arr [ i ] ) print ( s1 ) if __name__ == ' _ _ main _ _ ' : main ( ) NEW_LINE

d = int ( input ( ) ) n = int ( input ( ) ) l = list ( map ( int , input ( ) . split ( ) ) ) r = 0 for i in range ( n - 1 ) : r = r + ( d - l [ i ] ) print ( r ) NEW_LINE

d = int ( input ( ) ) n = int ( input ( ) ) x = list ( map ( int , input ( ) . split ( ) ) ) s = 0 for i in range ( n - 1 ) : s += d - x [ i ] print ( s ) NEW_LINE


import java . io . BufferedReader ; import java . io . IOException ; import java . io . InputStreamReader ; import java . util . * ;   public class Main { public static void main ( String [ ] args ) { FastScanner input = new FastScanner ( ) ; long n = input . nextInt ( ) * 2 ; long x1 = input . nextInt ( ) ; long y1 = input . nextInt ( ) ; long x2 = input . nextInt ( ) ; long y2 = input . nextInt ( ) ; long ans = ( long ) Math . ceil ( ( Math . sqrt ( ( ( x2 - x1 ) * ( x2 - x1 ) ) + ( ( y1 - y2 ) * ( y1 - y2 ) ) ) ) / n ) ; System . out . println ( ans ) ; }   static class FastScanner {   BufferedReader br = new BufferedReader ( new InputStreamReader ( System . in ) ) ; StringTokenizer st = new StringTokenizer ( " " ) ;   String next ( ) { while ( ! st . hasMoreTokens ( ) ) { try { st = new StringTokenizer ( br . readLine ( ) ) ; } catch ( IOException e ) { e . printStackTrace ( ) ; } } return st . nextToken ( ) ; }   int nextInt ( ) { return Integer . parseInt ( next ( ) ) ; }   long nextLong ( ) {   return Long . parseLong ( next ( ) ) ; }   double nextDouble ( ) { return Double . parseDouble ( next ( ) ) ; }   String nextLine ( ) throws IOException { return br . readLine ( ) ; } }   }

import java . io . BufferedReader ; import java . io . FileReader ; import java . io . IOException ; import java . io . InputStream ; import java . io . InputStreamReader ; import java . math . BigInteger ; import java . util . StringTokenizer ; public class ok { public static void main ( String [ ] args ) { InputReader in = new InputReader ( System . in ) ; long r ; int x , y , xx , yy ; r = in . nextInt ( ) ; x = in . nextInt ( ) ; y = in . nextInt ( ) ; xx = in . nextInt ( ) ; yy = in . nextInt ( ) ; r *= 2 ; long dist = ( x - xx ) * 1L * ( x - xx ) + ( y - yy ) * 1L * ( y - yy ) ; r *= r ; int L = 0 , R = 1000000 ; while ( R > L ) { int mid = L + ( R - L ) / 2 ; BigInteger temp = BigInteger . valueOf ( mid ) ; temp = temp . multiply ( BigInteger . valueOf ( mid ) ) ; temp = temp . multiply ( BigInteger . valueOf ( r ) ) ; int test = temp . compareTo ( BigInteger . valueOf ( dist ) ) ; if ( test == 0 || test == 1 ) R = mid ; else L = mid + 1 ; } System . out . println ( R ) ; } static class InputReader { private BufferedReader reader ; private StringTokenizer tokenizer ; public InputReader ( InputStream stream ) { reader = new BufferedReader ( new InputStreamReader ( stream ) ) ; tokenizer = null ; } public InputReader ( FileReader stream ) { reader = new BufferedReader ( stream ) ; tokenizer = null ; } public String nextLine ( ) { try { return reader . readLine ( ) ; } catch ( IOException e ) {

import java . util . Scanner ;   public class CentreMover { public static void main ( String [ ] args ) { Scanner scanner = new Scanner ( System . in ) ;   int r = scanner . nextInt ( ) ; int x = scanner . nextInt ( ) ; int y = scanner . nextInt ( ) ; x -= scanner . nextInt ( ) ; y -= scanner . nextInt ( ) ;   double X = ( double ) x / ( 2 * r ) ; double Y = ( double ) y / ( 2 * r ) ;   double distance = Math . sqrt ( X * X + Y * Y ) ;   System . out . println ( ( int ) Math . ceil ( distance ) ) ; } }

import java . util . * ; public class Amr_and_Pins { public static void main ( String arg [ ] ) { Scanner sc = new Scanner ( System . in ) ; int r = sc . nextInt ( ) ; int x1 = sc . nextInt ( ) ; int y1 = sc . nextInt ( ) ; int x2 = sc . nextInt ( ) ; int y2 = sc . nextInt ( ) ; double dis = 1.0 * Math . sqrt ( 1.0 * ( x2 - x1 ) * ( x2 - x1 ) + 1.0 * ( y2 - y1 ) * ( y2 - y1 ) ) ; long res = ( long ) Math . ceil ( dis / ( 2 * r ) ) ;   System . out . println ( res ) ; } }

import sys   input = sys . stdin . readline   r , x , y , xx , yy = map ( int , input ( ) . split ( ) )   dist = ( ( x - xx ) ** 2 + ( y - yy ) ** 2 ) ** 0.5   ans = dist / ( 2 * r )   if ans % 1 == 0 : print ( int ( ans ) ) else : print ( int ( ans ) + 1 )                       NEW_LINE

import mathr , x , y , x2 , y2 = map ( int , input ( ) . split ( ) ) dis = pow ( ( pow ( x - x2 , 2 ) + pow ( y - y2 , 2 ) ) , 0.5 ) print ( math . ceil ( dis / ( 2 * r ) ) ) NEW_LINE

import mathdef Appel ( arr ) : dobleR = arr [ 0 ] * 2 dx = True dy = True distX = ( arr [ 3 ] - arr [ 1 ] ) ** 2 distY = ( arr [ 4 ] - arr [ 2 ] ) ** 2 distTot = math . sqrt ( distX + distY ) if ( arr [ 3 ] == arr [ 1 ] ) : dx = False if ( arr [ 4 ] == arr [ 2 ] ) : dy = False if ( dy == False and dx == False ) : return 0 if ( dy or dx ) : result = distTot / dobleR return math . ceil ( result )           arr = [ ] arr = list ( map ( int , input ( ) . strip ( ) . split ( ) ) )   print ( Appel ( arr ) ) NEW_LINE


import java . util . * ; import java . io . * ; import java . math . * ;   public class Main {   final static int mod = 1000000007 ; static FastReader sc ; static PrintWriter out ;   public static void solution ( ) throws IOException { long n = sc . nextInt ( ) ; long len = Long . toBinaryString ( n ) . length ( ) ;

import java . util . * ; import java . io . * ;   public class Neko_Performs_Cat_Furrier_Transform {   static class FastReader { BufferedReader br ; StringTokenizer st ;   public FastReader ( ) { br = new BufferedReader ( new InputStreamReader ( System . in ) ) ; }   String next ( ) { while ( st == null || ! st . hasMoreElements ( ) ) { try { st = new StringTokenizer ( br . readLine ( ) ) ; } catch ( IOException e ) { e . printStackTrace ( ) ; } } return st . nextToken ( ) ; }   int nextInt ( ) { return Integer . parseInt ( next ( ) ) ; }   long nextLong ( ) { return Long . parseLong ( next ( ) ) ; }   double nextDouble ( ) { return Double . parseDouble ( next ( ) ) ; }   String nextLine ( ) { String str = " " ; try { str = br . readLine ( ) ; } catch ( IOException e ) { e . printStackTrace ( ) ; } return str ; }   }   public static void main ( String [ ] args ) {

import java . io . * ; import java . util . * ;   public class B { public static void main ( String [ ] args ) throws IOException { BufferedReader br = new BufferedReader ( new InputStreamReader ( System . in ) ) ; StringTokenizer st = new StringTokenizer ( br . readLine ( ) ) ; int x = Integer . parseInt ( st . nextToken ( ) ) ; int ops = 0 ; StringBuilder ans = new StringBuilder ( ) ; if ( ( x & ( x + 1 ) ) == 0 ) System . out . println ( 0 ) ; else { while ( ( x & ( x + 1 ) ) != 0 ) { if ( x % 2 == 0 ) { ops += 2 ; x ++ ; ans . append ( 0 + " ▁ " ) ; continue ; } ops = ops + 2 ;   int pos = getleftmostunsetbit ( x ) ; int t = ( int ) Math . pow ( 2 , pos + 1 ) - 1 ; x = x ^ t ; x += 1 ; ans . append ( Integer . toString ( pos + 1 ) . toString ( ) + " ▁ " ) ; } System . out . println ( ops ) ; System . out . println ( ans ) ;   }   }   public static int getleftmostunsetbit ( int n ) {   if ( ( n & ( n + 1 ) ) == 0 ) return n ;

x = int ( input ( ) ) cnt = 0 l = [ ] while x != ( 2 ** x . bit_length ( ) - 1 ) : if cnt % 2 : x += 1 else : x ^= 2 ** x . bit_length ( ) - 1 l . append ( x . bit_length ( ) ) cnt += 1 print ( cnt ) print ( * l ) NEW_LINE

x = int ( input ( ) ) flag = 0 ans = [ ] cnt = 0 while flag == 0 : s = bin ( x ) [ 2 : ] if s . count ( "0" ) == 0 : flag = 1 break   i = len ( s ) no = ( 2 ** i ) - 1 x = x ^ no ans . append ( i ) cnt += 1 s = bin ( x ) [ 2 : ] if s . count ( "0" ) == 0 : flag = 1 break   cnt += 1 x += 1   NEW_LINE

from math import ceil , floor , logx = int ( input ( ) ) def get_bits ( x ) : return len ( bin ( x ) [ 2 : ] ) def test ( x ) : return bin ( x ) [ 2 : ] . count ( '0' ) count = 0 val = [ ] while test ( x ) != 0 : if count % 2 == 0 : x = x ^ ( pow ( 2 , get_bits ( x ) ) - 1 ) val . append ( get_bits ( x ) ) else : x += 1 count += 1 print ( count ) print ( * val ) NEW_LINE

x = int ( input ( ) )   ans = [ ] for j in range ( 40 ) : b = format ( x , ' b ' ) NEW_LINE

import sys   try : import frosch   frosch . hook ( ) except ImportError : passini = lambda : int ( sys . stdin . readline ( ) ) inl = lambda : [ int ( x ) for x in sys . stdin . readline ( ) . split ( ) ] ins = lambda : sys . stdin . readline ( ) . rstrip ( ) debug = lambda * a , ** kw : print ( " \033[33m " , * a , " \033[0m " , ** dict ( file = sys . stderr , ** kw ) )     def is_pow2 ( x ) : while ( x & 1 ) == 0 : x >>= 1 return x == 1     def solve ( ) : x = ini ( ) a = [ ] while True : s = bin ( x ) [ 2 : ] i = s . find ( "0" ) if i < 0 : return a suffix = s [ i : ] if suffix == "0" * len ( suffix ) : d = len ( s ) - i - 1 else : d = len ( s ) - i x ^= 2 ** d - 1 x += 1 a . append ( d )     a = solve ( ) print ( len ( a ) * 2 ) print ( * a ) NEW_LINE


import java . util . * ; public class Main { public static void main ( String [ ] args ) { Scanner s = new Scanner ( System . in ) ;

import java . util . ArrayList ; import java . util . Scanner ;   public class InterestingDrink {   public static void main ( String [ ] args ) { Scanner sc = new Scanner ( System . in ) ; int n = sc . nextInt ( ) ; int m = sc . nextInt ( ) ; ArrayList < Integer > inputA = new ArrayList < > ( ) ; for ( int i = 0 ; i < n ; i ++ ) { int x = sc . nextInt ( ) ; inputA . add ( x ) ; } inputA . sort ( ( e1 , e2 ) -> e1 . compareTo ( e2 ) ) ; for ( int i = 0 ; i < m ; i ++ ) { int x = sc . nextInt ( ) ; System . out . print ( calc ( inputA , x ) + " ▁ " ) ; } }   public static int calc ( ArrayList < Integer > input , int value ) { int answer = - 1 ; int l = 0 , r = input . size ( ) - 1 , mid ; while ( l <= r ) { mid = ( l + r ) / 2 ; if ( input . get ( mid ) <= value ) { answer = mid ; l = mid + 1 ; } else { r = mid - 1 ; } }   return answer + 1 ; } }

import sysimport bisectt , r = map ( int , sys . stdin . readline ( ) . split ( ) ) a , b = sorted ( [ int ( x ) for x in sys . stdin . readline ( ) . split ( ) ] ) , [ int ( x ) for x in sys . stdin . readline ( ) . split ( ) ] R = sorted ( a ) out = [ ] for x in b : out . append ( bisect . bisect ( R , x ) ) print ( * out ) NEW_LINE

import sysn , m = ( list ( map ( int , input ( ) . split ( ) ) ) ) a = ( list ( map ( int , input ( ) . split ( ) ) ) ) b = ( list ( map ( int , input ( ) . split ( ) ) ) ) a . sort ( ) def findPos ( arr , l , r , x ) : m = 0 while l <= r : m = ( l + r ) // 2 if arr [ m ] <= x : l = m + 1 else : r = m - 1 return lans = [ ] for x in b : ans . append ( str ( findPos ( a , 0 , n - 1 , x ) ) ) print ( ' ▁ ' . join ( ans ) ) NEW_LINE

def answer ( n , m , a , b ) : a . sort ( ) ans = [ 0 ] * m tup_b = [ ( b [ i ] , i ) for i in range ( m ) ] tup_b . sort ( key = lambda t : t [ 0 ] ) NEW_LINE


import math , sys , bisect , heapq , osfrom collections import defaultdict , Counter , dequefrom itertools import groupby , accumulatefrom functools import lru_cache # sys . setrecursionlimit ( 200000000 ) int1 = lambda x : int ( x ) - 1d ef input ( ) : return sys . stdin . readline ( ) . rstrip ( ' \r \n ' ) # input = iter ( sys . stdin . buffer . read ( ) . decode ( ) . splitlines ( ) ) . __next__aj = lambda : list ( map ( int , input ( ) . split ( ) ) ) def list3d ( a , b , c , d ) : return [ [ [ d ] * c for j in range ( b ) ] for i in range ( a ) ] # MOD = 1000000000 + 7d ef Y ( c ) : print ( [ " NO " , " YES " ] [ c ] ) def y ( c ) : print ( [ " no " , " yes " ] [ c ] ) def Yy ( c ) : print ( [ " No " , " Yes " ] [ c ] )   def gcd ( a , b ) : if b == 0 : return a return gcd ( b , a % b )   def solve ( ) : n , = aj ( ) if n <= 2 : print ( n ) exit ( 0 ) a = n * ( n - 1 ) b = ( n - 1 ) * ( n - 2 ) ans = 0 # print ( a , b ) for i in range ( n - 2 , 0 , - 1 ) : if gcd ( i , a ) == 1 : ans = max ( ans , a * i ) if i <= n - 3 and gcd ( b , i ) == 1 : ans = max ( ans , b * i ) print ( ans ) try : # os . system ( " online _ judge . py " ) sys . stdin = open ( ' input . txt ' , ' r ' ) sys . stdout = open ( ' output . txt ' , ' w ' ) except : pass   solve ( )

import java . util . * ; import java . lang . * ; import java . io . * ;   public class Codechef { public static long LCM ( long A , long B , long C ) { long temp = A * B / GCD ( A , B ) ; return temp * C / GCD ( temp , C ) ; } public static long GCD ( long A , long B ) { long a = Math . max ( A , B ) ; long b = Math . min ( A , B ) ; while ( true ) { if ( a % b == 0 ) return b ; long temp = a ; a = b ; b = temp % b ; } } public static void main ( String [ ] args ) throws java . lang . Exception { Scanner scan = new Scanner ( System . in ) ; long n = scan . nextLong ( ) ; if ( n < 3 ) System . out . println ( n ) ; else if ( n % 2 != 0 ) System . out . println ( LCM ( n , n - 1 , n - 2 ) ) ; else { if ( GCD ( n , n - 3 ) == 1 ) System . out . println ( LCM ( n , n - 1 , n - 3 ) ) ; else System . out . println ( LCM ( n - 1 , n - 2 , n - 3 ) ) ; } } }

import java . util . * ; import java . io . * ; public class AiseHi { static class FastReader { BufferedReader br ; StringTokenizer st ; public FastReader ( ) { br = new BufferedReader ( new InputStreamReader ( System . in ) ) ; } String next ( ) { while ( st == null || ! st . hasMoreElements ( ) ) { try { st = new StringTokenizer ( br . readLine ( ) ) ; } catch ( IOException e ) { e . printStackTrace ( ) ; } } return st . nextToken ( ) ; } int nextInt ( ) { return Integer . parseInt ( next ( ) ) ; } long nextLong ( ) { return Long . parseLong ( next ( ) ) ; } double nextDouble ( ) { return Double . parseDouble ( next ( ) ) ; } String nextLine ( ) { String str = " " ; try { str = br . readLine ( ) ; } catch ( IOException e ) { e . printStackTrace ( ) ; } return str ; } } static FastReader sc = new FastReader ( ) ; public static void main ( String [ ] args ) { PrintWriter out = new PrintWriter ( System . out ) ; int t = 1 ;

import java . io . BufferedReader ; import java . io . IOException ; import java . io . InputStreamReader ; import java . util . Scanner ; import java . util . StringTokenizer ; import java . util . * ; public class c705a {

import mathn = int ( input ( ) )   if n == 1 : print ( 1 ) elif n == 2 : print ( 2 ) elif n == 3 : print ( 6 ) else : if n % 2 != 0 : print ( n * ( n - 1 ) * ( n - 2 ) ) elif math . gcd ( n , n - 3 ) == 1 : print ( n * ( n - 1 ) * ( n - 3 ) ) else : print ( ( n - 1 ) * ( n - 2 ) * ( n - 3 ) ) NEW_LINE

import math , sys , bisect , heapq , osfrom collections import defaultdict , Counter , dequefrom itertools import groupby , accumulatefrom functools import lru_cache NEW_LINE

import sys , os , ioimport math , bisect , operatorinf , mod = float ( ' inf ' ) , 10 ** 9 + 7 NEW_LINE

from math import gcdn = int ( input ( ) ) if ( n < 3 ) : print ( n ) else : if ( n % 2 == 1 ) : print ( n * ( n - 1 ) * ( n - 2 ) ) else : if ( gcd ( n , n - 3 ) == 1 ) : print ( n * ( n - 1 ) * ( n - 3 ) ) else : print ( ( n - 3 ) * ( n - 1 ) * ( n - 2 ) ) NEW_LINE


import java . util . ArrayList ; import java . util . Arrays ; import java . util . HashMap ; import java . util . LinkedHashMap ; import java . util . Map ; import java . util . Scanner ; import java . util . * ; import java . util . stream . Collectors ;   public class absolute { static List < Integer > primes ; static int [ ] nextprime ; static void sieveOfEratosthenes ( ) { int n = 100004 ; boolean prime [ ] = new boolean [ n + 1 ] ; for ( int i = 0 ; i <= n ; i ++ ) prime [ i ] = true ; for ( int p = 2 ; p * p <= n ; p ++ ) { if ( prime [ p ] == true ) { for ( int i = p * p ; i <= n ; i += p ) prime [ i ] = false ; } } int next = 2 , pos = 0 ; nextprime [ 0 ] = nextprime [ 1 ] = 2 ; for ( int i = n ; i >= 2 ; i -- ) { if ( prime [ i ] == true ) { nextprime [ i ] = i ; next = i ; } else { nextprime [ i ] = next ; } } } public static int binary ( int n ) { int st = 0 , end = primes . size ( ) - 1 , pos = - 1 ; while ( st <= end ) { int mid = st + ( end - st ) / 2 ; if ( primes . get ( mid ) > n ) { pos = mid ; end = mid - 1 ; } else st = mid + 1 ; }

import java . util . ArrayList ; import java . util . Scanner ;   public class PrimeMatrix {   private static ArrayList < Integer > primes ; public static void main ( String [ ] args ) { Boolean [ ] PrimeGetter = new Boolean [ 100004 ] ; primes = new ArrayList < > ( ) ;   for ( int i = 2 ; i < 100004 ; i ++ ) { if ( PrimeGetter [ i ] == null ) { for ( int j = 2 * i ; j < 100004 ; j += i ) { PrimeGetter [ j ] = false ; }   primes . add ( i ) ; } }   Scanner scanner = new Scanner ( System . in ) ;   int n = scanner . nextInt ( ) ; int m = scanner . nextInt ( ) ;   long [ ] row = new long [ n ] ; long [ ] col = new long [ m ] ;   for ( int i = 0 ; i < n ; i ++ ) { for ( int j = 0 ; j < m ; j ++ ) { int x = scanner . nextInt ( ) ;   int diff = primes . get ( search ( x ) ) - x ;   row [ i ] += diff ; col [ j ] += diff ; } }   long min = row [ 0 ] ;   for ( int i = 1 ; i < n ; i ++ ) min = Math . min ( min , row [ i ] ) ; for ( int i = 0 ; i < m ; i ++ ) min = Math . min ( min , col [ i ] ) ;   System . out . println ( min ) ; }   private static int search ( int x ) { int first = 0 , last = primes . size ( ) - 1 ; int result = - 1 ;   while ( first <= last ) { int mid = ( first + last ) / 2 ;   if ( x <= primes . get ( mid ) ) { result = mid ; last = mid - 1 ; } else first = mid + 1 ; }   return result ; } }

import sysMAX_SIZE = 100001 isprime = [ True ] * MAX_SIZEprime = [ ] SPF = [ None ] * ( MAX_SIZE ) d = dict ( ) def manipulated_seive ( N ) : isprime [ 0 ] = isprime [ 1 ] = False for i in range ( 2 , N ) : if isprime [ i ] == True : prime . append ( i ) d . setdefault ( i , 1 ) SPF [ i ] = i j = 0 while ( j < len ( prime ) and i * prime [ j ] < N and prime [ j ] <= SPF [ i ] ) : isprime [ i * prime [ j ] ] = False d . setdefault ( i * prime [ j ] , 0 ) SPF [ i * prime [ j ] ] = prime [ j ] j += 1 if __name__ == ' _ _ main _ _ ' : manipulated_seive ( 100001 ) d . setdefault ( 1 , 0 ) prev = 100003 for i in range ( 100000 , 0 , - 1 ) : if d [ i ] == 0 : d [ i ] = prev else : d [ i ] = i prev = i   ans = sys . maxsize n , m = map ( int , input ( ) . split ( ) ) l = [ ] for i in range ( n ) : l . append ( list ( map ( int , input ( ) . split ( ) ) ) ) for i in range ( n ) : c = 0 for j in range ( m ) : c += ( d [ l [ i ] [ j ] ] - l [ i ] [ j ] ) ans = min ( c , ans ) for j in range ( m ) : c = 0 for i in range ( n ) : c += ( d [ l [ i ] [ j ] ] - l [ i ] [ j ] ) ans = min ( c , ans ) print ( ans ) NEW_LINE

import mathn , m = map ( int , input ( ) . rstrip ( ) . split ( ) ) row = [ 0 ] * ncol = [ 0 ] * mdef isPrime ( x ) : if x in [ 2 , 3 , 5 , 7 , 11 , 13 , 17 , 19 ] : return True if x == 1 : return False for i in range ( 2 , int ( math . sqrt ( x ) ) + 2 ) : if x % i == 0 : return False return Trueprimes = [ 0 ] * 100011 for i in range ( 1 , 100011 ) : if isPrime ( i ) : primes [ i ] = 1 for i in range ( n ) : li = list ( map ( int , input ( ) . rstrip ( ) . split ( ) ) ) for j in range ( m ) : x = li [ j ] while primes [ x ] != 1 : x += 1 row [ i ] += x - li [ j ] col [ j ] += x - li [ j ] minm = min ( row + col ) print ( minm ) NEW_LINE

n , m = map ( int , input ( ) . split ( ) ) matrix = [ [ * map ( int , input ( ) . split ( ) ) ] for _ in range ( n ) ]   MAX_ELEM = int ( 2e5 )   def sieve ( ) : prime = [ 1 ] * MAX_ELEM i = 2 while i * i < MAX_ELEM : if prime [ i ] : j = 2 while i * j < MAX_ELEM : prime [ i * j ] = False j += 1 i += 1 prime [ 0 ] = prime [ 1 ] = False nxtPrime = [ 0 ] * MAX_ELEM cur = - 1 for i in range ( MAX_ELEM - 1 , - 1 , - 1 ) : if prime [ i ] : cur = i nxtPrime [ i ] = cur return nxtPrime   nxtPrime = sieve ( )   ans = int ( 1e9 )   for i in range ( n ) : res = 0 for k in range ( m ) : res += nxtPrime [ matrix [ i ] [ k ] ] - matrix [ i ] [ k ] ans = min ( ans , res )   for j in range ( m ) : res = 0 for k in range ( n ) : res += nxtPrime [ matrix [ k ] [ j ] ] - matrix [ k ] [ j ] ans = min ( ans , res )   print ( ans )     NEW_LINE


import java . util . * ; import java . util . Scanner ; import java . io . * ; import javax . lang . model . util . ElementScanner6 ; import static java . lang . System . out ;    public class A612M2 {   public static void main ( String args [ ] ) {   FastReader in = new FastReader ( ) ; PrintWriter pr = new PrintWriter ( new BufferedWriter ( new OutputStreamWriter ( System . out ) ) ) ; int tc = 1 ;

import java . util . Scanner ;   public class ER4A {   public static void main ( String [ ] args ) {

import java . io . BufferedReader ; import java . io . IOException ; import java . io . InputStream ; import java . io . InputStreamReader ; import java . util . StringTokenizer ; import java . util . TreeSet ;   public class Main {    public static void main ( String [ ] args ) throws IOException { Scanner s = new Scanner ( System . in ) ; int n = s . nextInt ( ) , p = s . nextInt ( ) , q = s . nextInt ( ) ; String word = s . next ( ) ;   boolean flag = false ;    for ( int i = 0 ; i <= n ; i ++ ) { int pp = i ; int qq = ( n - ( pp * Math . min ( p , q ) ) ) / Math . max ( p , q ) ;   if ( pp >= 0 && qq >= 0 && ( pp * p ) + ( qq * q ) == n ) { flag = true ;   System . out . println ( pp + qq ) ;

import java . util . * ;   public class Main {   static int countp = 0 ; static int countq = 0 ;   public static void main ( String [ ] args ) { Scanner input = new Scanner ( System . in ) ; int n = input . nextInt ( ) ; int a [ ] = new int [ 2 ] ; a [ 0 ] = input . nextInt ( ) ; a [ 1 ] = input . nextInt ( ) ; String s = input . next ( ) ; if ( s . length ( ) % a [ 0 ] == 0 ) { countp = s . length ( ) / a [ 0 ] ; } else if ( s . length ( ) % a [ 1 ] == 0 ) { countq = s . length ( ) / a [ 1 ] ;   } else { for ( int i = 0 ; i <= 100 ; i ++ ) { if ( ( s . length ( ) - ( a [ 0 ] * i ) ) % a [ 1 ] == 0 && ( ( s . length ( ) - ( a [ 0 ] * i ) ) / a [ 1 ] ) >= 0 ) { countp = i ; countq = ( s . length ( ) - ( a [ 0 ] * i ) ) / a [ 1 ] ; break ; } } } int start = 0 ; if ( countp == 0 && countq == 0 ) { System . out . println ( " - 1" ) ; } else { System . out . println ( countp + countq ) ; while ( countp -- > 0 ) { System . out . println ( s . substring ( start , start + a [ 0 ] ) ) ; start = start + a [ 0 ] ; } while ( countq -- > 0 ) { System . out . println ( s . substring ( start , start + a [ 1 ] ) ) ; start += a [ 1 ] ; } } }   }

n , xs , ys = map ( int , input ( ) . split ( ) ) s = input ( ) for x in range ( n // xs + 1 ) : if ( n - x * xs ) % ys == 0 : y = ( n - x * xs ) // ys print ( x + y ) for i in range ( x ) : print ( s [ i * xs : ( i + 1 ) * xs ] ) s = s [ x * xs : len ( s ) ] for j in range ( y ) : print ( s [ j * ys : ( j + 1 ) * ys ] ) exit ( ) print ( - 1 )       NEW_LINE

from math import ceil     n , p , q = map ( int , input ( ) . split ( ) ) s = input ( )   if p == n or q == n : print ( f ' 1 \n { s } ' ) else : if p > q : p , q = q , p   P = ceil ( n / p ) Q = ceil ( n / q ) cnts = [ - 1 , - 1 ] i = P while i >= 0 : _sum = p * i j = 0 while j <= Q and _sum < n : _sum += q j += 1   if _sum == n : cnts = [ i , j ] break   i -= 1   if _sum == n : cnts = [ i , j ] if cnts [ 0 ] == - 1 : print ( - 1 ) else : print ( sum ( cnts ) ) _i = 0 for i in range ( cnts [ 0 ] ) : print ( s [ _i : _i + p ] ) _i += p for j in range ( cnts [ 1 ] ) : print ( s [ _i : _i + q ] ) _i += q NEW_LINE

try : import re   def cg ( string , length ) : return re . findall ( ' . { % d } ' % length , string ) n , p , q = list ( map ( int , input ( ) . split ( " ▁ " ) ) ) s = input ( ) u = 0 if len ( s ) % p == 0 : u = 1 elif len ( s ) % q == 0 : u = 2 else : u = 3 if u == 1 : print ( n // p ) k = cg ( s , p ) for i in k : print ( i ) elif u == 2 : print ( n // q ) k = cg ( s , q ) for i in k : print ( i ) elif u == 3 : flag = 0 for i in range ( 1 , n ) : for j in range ( 1 , n ) : if p * i + q * j == n : op = [ i , j ] flag = 1 break if flag == 1 : print ( sum ( op ) ) u = cg ( s [ 0 : p * op [ 0 ] ] , p ) v = cg ( s [ p * op [ 0 ] : ] , q ) ko = ( u + v ) for i in ko : print ( i ) else : print ( - 1 ) except : pass NEW_LINE

def yo ( ma , mi , n , s ) : main1 = n // ma main2 = n // mi flag = 0   for i in range ( main1 , - 1 , - 1 ) : for j in range ( 0 , main2 + 1 ) : NEW_LINE

sn = list ( map ( int , input ( ) . split ( ) ) ) n = sn [ 0 ] p = sn [ 1 ] q = sn [ 2 ]   s = input ( )   lim = 0 flag = Falseflag2 = Falsestrings = [ ] while ( lim <= n ) : if ( ( n - lim ) % p == 0 ) : flag = True break elif ( ( n - lim ) % q == 0 ) : flag = True break lim += p   lim = 0 if ( flag ) : NEW_LINE


import java . util . * ; public class MyClass { public static void main ( String args [ ] ) { Scanner sc = new Scanner ( System . in ) ; ArrayList < Integer > a = new ArrayList < Integer > ( ) ; int n = sc . nextInt ( ) ; int [ ] arr = new int [ n ] ; int p = 0 , s = 0 , c = 0 ; for ( int i = 0 ; i < n ; i ++ ) arr [ i ] = sc . nextInt ( ) ; int [ ] e = arr . clone ( ) ; Arrays . sort ( arr ) ; int start = 0 , end = n - 1 ; while ( start <= end ) { int temp = arr [ start ] ; arr [ start ] = arr [ end ] ; arr [ end ] = temp ; start ++ ; end -- ; } while ( p < n ) { for ( int i = 0 ; i < n ; i ++ ) { int k = arr [ p ] ; if ( k == e [ i ] ) { e [ i ] = - 1 ; a . add ( i + 1 ) ; p ++ ; if ( i == 0 ) s = s + 1 ; else s = s + ( arr [ i ] * i ) + 1 ; break ; } } } System . out . println ( s ) ; for ( int i : a ) System . out . print ( i + " ▁ " ) ; } }

import java . util . * ;   public class B { public static < K , V > K getKey ( Map < K , V > map , V value ) { for ( Map . Entry < K , V > entry : map . entrySet ( ) ) { if ( value . equals ( entry . getValue ( ) ) ) { return entry . getKey ( ) ; } } return null ; }   public static final class Pair { public int first ; public int second ; public Pair ( int first , int second ) { this . first = first + 1 ; this . second = second ; }

import java . util . * ;   public class B { public static < K , V > K getKey ( Map < K , V > map , V value ) { for ( Map . Entry < K , V > entry : map . entrySet ( ) ) { if ( value . equals ( entry . getValue ( ) ) ) { return entry . getKey ( ) ; } } return null ; }   public static final class Pair implements Comparable < Pair > { public int first ; public int second ; public Pair ( int first , int second ) { this . first = first + 1 ; this . second = second ; }   public int compareTo ( Pair o ) { return Integer . compare ( o . second , second ) ; }

import java . util . * ; import java . lang . * ; import java . io . * ; public class Main { PrintWriter out ; FastReader sc ; long mod = ( long ) ( 1e9 + 7 ) ; long maxlong = Long . MAX_VALUE ; long minlong = Long . MIN_VALUE ; public void sol ( ) { int n = ni ( ) ; int [ ] [ ] ar = new int [ n ] [ 2 ] ; for ( int i = 0 ; i < n ; i ++ ) { ar [ i ] [ 0 ] = ni ( ) ; ar [ i ] [ 1 ] = i ; } Arrays . sort ( ar , new Comparator < int [ ] > ( ) { public int compare ( int [ ] a , int [ ] b ) { return Integer . compare ( b [ 0 ] , a [ 0 ] ) ; } } ) ; StringBuilder sb = new StringBuilder ( ) ; long ans = 0 ; for ( int i = 0 ; i < n ; i ++ ) { ans += ( ar [ i ] [ 0 ] * 1l * ( i ) ) + 1 ; sb . append ( ar [ i ] [ 1 ] + 1 + " ▁ " ) ; } pl ( ans ) ; pl ( sb ) ; } public static void main ( String [ ] args ) { Main g = new Main ( ) ; g . out = new PrintWriter ( System . out ) ; g . sc = new FastReader ( ) ; int t = 1 ;

if __name__ == " _ _ main _ _ " : n = int ( input ( ) ) a = list ( map ( int , input ( ) . split ( ) ) ) dic = { } s = set ( a ) ans = [ ] for i in range ( n ) : dic . setdefault ( a [ i ] , [ ] ) dic [ a [ i ] ] . append ( i + 1 ) a . sort ( reverse = True ) sum = 0 for i in range ( n ) : num = dic [ a [ i ] ] [ 0 ] sum = sum + ( ( a [ i ] * i ) + 1 ) ans . append ( num ) dic [ a [ i ] ] . remove ( num ) print ( sum ) print ( * ans )     NEW_LINE

n = int ( input ( ) )   daf = list ( map ( int , input ( ) . split ( ) ) ) mul = [ x for x in range ( n ) ] has = 0 daf2 = sorted ( daf , reverse = True ) daf_has = [ ]   for i in range ( n ) : x = daf2 [ i ] y = daf . index ( x ) daf_has . append ( str ( y + 1 ) ) daf [ y ] = 0 has += daf2 [ i ] * mul [ i ] has += nprint ( has ) print ( ' ▁ ' . join ( daf_has ) ) NEW_LINE

n = int ( input ( ) ) s = list ( map ( int , input ( ) . split ( ) ) ) a = sorted ( s , reverse = True ) sum_a = sum ( [ a [ x ] * x + 1 for x in range ( 0 , n ) ] ) print ( sum_a ) i = 0 while i < n : print ( s . index ( a [ i ] ) + 1 , end = " ▁ " ) s [ s . index ( a [ i ] ) ] = 0 i += 1 NEW_LINE

''' a = [ int ( i ) ▁ for ▁ i ▁ in ▁ input ( ) . split ( ) ] x = a [ 0 ] y = a [ 1 ] z = a [ 2 ] if ▁ y = = x ▁ and ▁ z = = 0 : ▁ ▁ ▁ ▁ print ( '0 ' ) elif ▁ x > y + z : ▁ ▁ ▁ ▁ print ( ' + ' ) elif ▁ y > x + z : ▁ ▁ ▁ ▁ print ( ' - ' ) else : ▁ ▁ ▁ ▁ print ( ' ? ' ) ''' n = int ( input ( ) ) z = [ int ( i ) for i in input ( ) . split ( ) ] x = [ ] d = 0 v = ' ' for i in range ( n ) : c = 0 e = 0 for f in range ( len ( z ) ) : if z [ f ] > c and f + 1 not in x : c = z [ f ] e = f + 1 d += ( i * c ) + 1 x . append ( e ) print ( d ) for i in x : v += str ( i ) v += ' ▁ ' print ( v ) NEW_LINE


import java . util . Scanner ;    public class RotateFlipandZoom {   static char [ ] [ ] brr ; public static void main ( String [ ] args ) {

import java . io . BufferedReader ; import java . io . IOException ; import java . io . InputStreamReader ; import java . util . StringTokenizer ;   public class Main { public static void main ( String [ ] args ) { BufferedReader br = new BufferedReader ( new InputStreamReader ( System . in ) ) ; try { StringTokenizer st = new StringTokenizer ( br . readLine ( ) ) ; int col = Integer . parseInt ( st . nextToken ( ) ) ; int row = Integer . parseInt ( st . nextToken ( ) ) ; char [ ] [ ] arr = new char [ row ] [ col ] ; for ( int i = 0 ; i < row ; i ++ ) { String line = br . readLine ( ) ; arr [ i ] = line . toCharArray ( ) ; } for ( int j = 0 ; j < col ; j ++ ) { String nl = " " ; for ( int i = 0 ; i < row ; i ++ ) { nl = nl + arr [ i ] [ j ] + arr [ i ] [ j ] ; } System . out . println ( nl ) ; System . out . println ( nl ) ; } } catch ( IOException e ) { } } }

[ w , h ] = [ int ( x ) for x in input ( ) . split ( ) ]   image = [ ]   for i in range ( h ) : image . append ( input ( ) )     for x in range ( w * 2 ) : for y in range ( h * 2 ) : final_x = int ( y / 2 ) final_y = int ( x / 2 ) NEW_LINE

w , h = map ( int , input ( ) . split ( ) ) l = [ ] for i in range ( h ) : s = input ( ) l . append ( s ) for i in range ( w ) : s = ' ' for j in range ( h - 1 , - 1 , - 1 ) : s += l [ j ] [ i ] * 2 s = s [ : : - 1 ] print ( s ) print ( s ) NEW_LINE


import java . util . * ; import java . lang . * ; import java . io . * ; import java . math . * ;    public class file {

import java . io . BufferedReader ; import java . io . IOException ; import java . io . InputStreamReader ; import java . util . Scanner ; import java . util . StringTokenizer ; import java . util . * ; public class c580a {

import java . util . * ; import java . lang . * ; import java . io . * ;   public class Codechef { public static void main ( String [ ] args ) throws java . lang . Exception { Scanner sc = new Scanner ( System . in ) ; PrintWriter out = new PrintWriter ( System . out ) ; int n = sc . nextInt ( ) ; if ( n % 2 == 0 ) { out . println ( " NO " ) ; out . close ( ) ; return ; } out . println ( " YES " ) ; StringBuilder f = new StringBuilder ( ) ; StringBuilder s = new StringBuilder ( ) ; int k = 1 ; boolean flag = true ; while ( k + 1 <= 2 * n ) { if ( flag ) { f . append ( k + " ▁ " ) ; s . append ( ( k + 1 ) + " ▁ " ) ; k += 2 ; } else { f . append ( ( k + 1 ) + " ▁ " ) ; s . append ( k + " ▁ " ) ; k += 2 ; } flag = ! flag ; } out . println ( f . toString ( ) + s . toString ( ) ) ; out . close ( ) ; } }

import java . util . Scanner ; public class Main { public static void main ( String args [ ] ) { Scanner s = new Scanner ( System . in ) ; int n = s . nextInt ( ) ; if ( n % 2 == 0 ) { System . out . println ( " NO " ) ; } else { System . out . println ( " YES " ) ; int arr [ ] = new int [ 2 * n ] ; int k = 1 ; for ( int i = 0 ; i < n ; i ++ ) { if ( i % 2 == 0 ) { arr [ i ] = k ; arr [ i + n ] = k + 1 ; } else { arr [ i ] = k + 1 ; arr [ i + n ] = k ; } k = k + 2 ; } for ( int i = 0 ; i < 2 * n ; i ++ ) { System . out . print ( arr [ i ] + " ▁ " ) ; } } } }

from sys import stdin , stdoutfrom math import floor , gcd , fabs , factorial , fmod , sqrt , inf , logfrom collections import defaultdict as dd , dequefrom heapq import merge , heapify , heappop , heappush , nsmallestfrom bisect import bisect_left as bl , bisect_right as br , bisect mod = pow ( 10 , 9 ) + 7 mod2 = 998244353 def inp ( ) : return stdin . readline ( ) . strip ( ) def iinp ( ) : return int ( inp ( ) ) def out ( var , end = " \n " ) : stdout . write ( str ( var ) + " \n " ) def outa ( * var , end = " \n " ) : stdout . write ( ' ▁ ' . join ( map ( str , var ) ) + end ) def lmp ( ) : return list ( mp ( ) ) def mp ( ) : return map ( int , inp ( ) . split ( ) ) def smp ( ) : return map ( str , inp ( ) . split ( ) ) def l1d ( n , val = 0 ) : return [ val for i in range ( n ) ] def l2d ( n , m , val = 0 ) : return [ l1d ( m , val ) for j in range ( n ) ] def remadd ( x , y ) : return 1 if x % y else 0 def ceil ( a , b ) : return ( a + b - 1 ) // b def isprime ( x ) : if x <= 1 : return False if x in ( 2 , 3 ) : return True if x % 2 == 0 : return False for i in range ( 3 , int ( sqrt ( x ) ) + 1 , 2 ) : if x % i == 0 : return False return True n = iinp ( ) if ( n % 2 ) : print ( " YES " ) for i in range ( 0 , 2 * n , 4 ) : if i == 0 : print ( i + 1 , end = ' ▁ ' ) else : print ( i , i + 1 , end = ' ▁ ' ) for i in range ( 2 , 2 * n + 1 , 4 ) : if i == 2 * n : print ( i , end = ' ▁ ' ) else : print ( i , i + 1 , end = ' ▁ ' ) print ( ) else : print ( " NO " ) NEW_LINE

n = int ( input ( ) )   if n % 2 : print ( " YES " ) ls = [ 0 ] * 2 * n c = 1 i = - 1 while c <= 2 * n : i = i + 1 ls [ i ] = c i = ( i + n ) % ( 2 * n ) ls [ i ] = c + 1 c = c + 2 print ( * ls ) else : print ( " NO " ) NEW_LINE

n = int ( input ( ) ) if n & 1 : NEW_LINE

n = int ( input ( ) ) lst = [ 0 ] * ( 2 * n ) f = 0 lst [ 0 ] = 1 ind = 0 for i in range ( 2 , ( 2 * n ) + 1 ) : if f == 0 : ind = ( ind + n ) % ( 2 * n ) lst [ ind ] = i f = 1 else : ind -= 1 lst [ ind ] = i f = 0   if n % 2 : print ( " YES " ) print ( * lst ) else : print ( " NO " ) NEW_LINE


import java . io . * ; import java . util . * ;   public class GFG { public static void main ( String [ ] args ) { Scanner sc = new Scanner ( System . in ) ; int n = sc . nextInt ( ) ;

import java . io . * ; import java . util . * ; import java . math . * ; public class Maths { static final Random random = new Random ( ) ; static PrintWriter out = new PrintWriter ( ( System . out ) ) ; static Reader sc = new Reader ( ) ; public static void main ( String args [ ] ) throws IOException {

import java . util . * ; import java . math . * ; import java . io . BufferedReader ; import java . io . IOException ; import java . io . InputStreamReader ; import java . util . StringTokenizer ;

import java . util . * ; public class problem { public static void main ( String args [ ] ) { Scanner sc = new Scanner ( System . in ) ; int x = sc . nextInt ( ) ; if ( x % 4 == 1 ) { System . out . println ( "0" + " ▁ A " ) ; } else if ( x % 4 == 3 ) { System . out . println ( "2" + " ▁ A " ) ; } else if ( x % 4 == 2 ) { System . out . println ( "1" + " ▁ B " ) ; } else { System . out . println ( "1" + " ▁ A " ) ; } } }

import sys   def main ( ) : n = int ( sys . stdin . read ( ) . strip ( ) ) d = { 1 : '0 ▁ A ' , 3 : '2 ▁ A ' , 2 : '1 ▁ B ' , 0 : '1 ▁ A ' } return d [ n % 4 ]   print ( main ( ) ) NEW_LINE

s = int ( input ( ) ) g = s % 4 if g == 1 : print ( "0 ▁ A " ) if g == 2 : print ( "1 ▁ B " ) if g == 0 : print ( "1 ▁ A " ) if g == 3 : print ( "2 ▁ A " ) NEW_LINE

print ( [ '1 ▁ A ' , '0 ▁ A ' , '1 ▁ B ' , '2 ▁ A ' ] [ int ( input ( ) ) % 4 ] ) NEW_LINE

x = int ( input ( ) ) if ( x % 4 == 1 ) : print ( "0 ▁ A " ) elif ( x % 4 == 0 ) : print ( "1 ▁ A " ) elif ( x % 4 == 2 ) : print ( "1 ▁ B " ) else : print ( "2 ▁ A " ) NEW_LINE


import java . util . * ; public class P2 {   public static void main ( String [ ] args ) { Scanner sc = new Scanner ( System . in ) ; int n = sc . nextInt ( ) ; int c = 1 ; int k = 2 ; System . out . print ( 2 + " ▁ " ) ; for ( int i = 0 ; i < n - 2 ; i ++ ) { c ++ ; k += c ; if ( k % n == 0 ) { System . out . print ( n + " ▁ " ) ; } else System . out . print ( k % n + " ▁ " ) ; } } }

import java . io . BufferedReader ; import java . io . IOException ; import java . io . InputStreamReader ; import java . io . PrintWriter ; import java . math . BigInteger ; import java . util . * ;   public class Main {   public static void main ( String [ ] args ) throws IOException { FastScanner input = new FastScanner ( ) ; int n = input . nextInt ( ) ; StringBuilder ans = new StringBuilder ( ) ; int current = 1 ; for ( int i = 1 ; i < n ; i ++ ) { current += i ; if ( current != n ) { ans . append ( current % n + " ▁ " ) ; current = current % ( n ) ; } else { ans . append ( current + " ▁ " ) ; } } System . out . println ( ans ) ; }   static class FastScanner {   BufferedReader br = new BufferedReader ( new InputStreamReader ( System . in ) ) ; StringTokenizer st = new StringTokenizer ( " " ) ;   String next ( ) { while ( ! st . hasMoreTokens ( ) ) { try { st = new StringTokenizer ( br . readLine ( ) ) ; } catch ( IOException e ) { e . printStackTrace ( ) ; } } return st . nextToken ( ) ; }   int nextInt ( ) { return Integer . parseInt ( next ( ) ) ; }   long nextLong ( ) {   return Long . parseLong ( next ( ) ) ; }   double nextDouble ( ) { return Double . parseDouble ( next ( ) ) ; } }   }

import java . util . Scanner ;   public class Main {   public static void main ( String [ ] args ) { Scanner scan = new Scanner ( System . in ) ; int n = scan . nextInt ( ) ; int total = n - 1 ; int ans = 1 ; for ( int i = 1 ; i <= total ; i ++ ) { ans += i ; if ( ans > n ) { ans = ans % n ; } if ( i == total ) { System . out . print ( ans ) ; } else { System . out . print ( ans + " ▁ " ) ; } } System . out . println ( ) ; scan . close ( ) ; }   }

import java . io . BufferedReader ; import java . io . IOException ; import java . io . InputStreamReader ; import java . io . PrintWriter ; import java . util . * ; public class C { static class FastScanner { BufferedReader br = new BufferedReader ( new InputStreamReader ( System . in ) ) ; StringTokenizer st = new StringTokenizer ( " " ) ;   String next ( ) { while ( ! st . hasMoreTokens ( ) ) try { st = new StringTokenizer ( br . readLine ( ) ) ; } catch ( IOException e ) { e . printStackTrace ( ) ; } return st . nextToken ( ) ; }   int nextInt ( ) { return Integer . parseInt ( next ( ) ) ; }   int [ ] nextArray ( int n ) { int [ ] a = new int [ n ] ; for ( int i = 0 ; i < n ; i ++ ) a [ i ] = nextInt ( ) ; return a ; }   long nextLong ( ) { return Long . parseLong ( next ( ) ) ; } } static class FastWriter extends PrintWriter { FastWriter ( ) { super ( System . out ) ; }   void println ( int [ ] array ) { for ( int i = 0 ; i < array . length ; i ++ ) { print ( array [ i ] + " ▁ " ) ; } println ( ) ; }   void println ( long [ ] array ) { for ( int i = 0 ; i < array . length ; i ++ ) { print ( array [ i ] + " ▁ " ) ; } println ( ) ; } } public static void main ( String [ ] args ) {

n = int ( input ( ) ) s = 1 result = [ ] t = 1 for i in range ( 1 , n ) : t += s if t > n : t -= n result . append ( t ) s += 1 print ( * result ) NEW_LINE

n = int ( input ( ) )   arr = [ i for i in range ( 1 , n + 1 ) ] * 100   ans = [ ] i = 1j = 1 while n > 1 : ans . append ( arr [ i ] ) i += j + 1 j += 1 n -= 1   print ( * ans ) NEW_LINE

n = int ( input ( ) )   x = 0   for i in range ( 1 , n ) : x = ( x + i ) % n print ( x + 1 , end = ' ▁ ' ) NEW_LINE

n = int ( input ( ) ) a = 0 b = [ ] for i in range ( 1 , n ) : a = ( a + i ) % n b . append ( a + 1 ) print ( * b ) NEW_LINE


import java . io . BufferedReader ; import java . io . IOException ; import java . io . InputStreamReader ; import java . io . OutputStreamWriter ; import java . io . PrintWriter ; import java . io . StreamTokenizer ; import java . util . Arrays ;   public class Main { public static void main ( String [ ] args ) throws IOException { StreamTokenizer st = new StreamTokenizer ( new BufferedReader ( new InputStreamReader ( System . in ) ) ) ; PrintWriter pw = new PrintWriter ( new OutputStreamWriter ( System . out ) ) ; int MOD = 1000000007 ; st . nextToken ( ) ; int n = ( int ) st . nval ; st . nextToken ( ) ; int k = ( int ) st . nval ; int [ ] dp = new int [ n + 1 ] ; int [ ] tmp = new int [ n + 1 ] ; Arrays . fill ( dp , 1 ) ; for ( int i = 2 ; i <= k ; i ++ ) { Arrays . fill ( tmp , 0 ) ; for ( int j = 1 ; j <= n ; j ++ ) { for ( int t = 1 ; t * j <= n ; t ++ ) { tmp [ t * j ] = ( tmp [ t * j ] + dp [ j ] ) % MOD ; } } for ( int j = 1 ; j <= n ; j ++ ) { dp [ j ] = tmp [ j ] ; } } int ans = 0 ; for ( int i = 1 ; i <= n ; i ++ ) { ans = ( ans + dp [ i ] ) % MOD ; } pw . print ( ans % MOD ) ; pw . flush ( ) ; }   }

import java . util . Arrays ; import java . util . Scanner ;   public class Main { public static void main ( String [ ] args ) { Scanner sc = new Scanner ( System . in ) ; int MOD = 1000000007 ; int n = sc . nextInt ( ) ; int k = sc . nextInt ( ) ; sc . close ( ) ; int [ ] dp = new int [ n + 1 ] ; int [ ] tmp = new int [ n + 1 ] ; Arrays . fill ( dp , 1 ) ; for ( int i = 2 ; i <= k ; i ++ ) { Arrays . fill ( tmp , 0 ) ; for ( int j = 1 ; j <= n ; j ++ ) { for ( int t = 1 ; t * j <= n ; t ++ ) { tmp [ t * j ] = ( tmp [ t * j ] + dp [ j ] ) % MOD ; } } for ( int j = 1 ; j <= n ; j ++ ) { dp [ j ] = tmp [ j ] ; } } int ans = 0 ; for ( int i = 1 ; i <= n ; i ++ ) { ans = ( ans + dp [ i ] ) % MOD ; } System . out . println ( ans % MOD ) ; }   }

import java . util . * ; import java . math . * ; import java . io . * ;

import java . io . BufferedReader ; import java . io . IOException ; import java . io . InputStreamReader ; import java . math . BigInteger ;   import java . util . * ; import javafx . util . Pair ;   public class Main { static long mod = ( long ) ( 1e9 + 7 ) ; public static void main ( String args [ ] ) { FastScanner input = new FastScanner ( ) ; int n = input . nextInt ( ) ; int size = input . nextInt ( ) ; int len = Math . max ( n , size ) + 1 ; long dp [ ] [ ] = new long [ len ] [ len ] ; for ( int i = 1 ; i <= n ; i ++ ) { dp [ 1 ] [ i ] = 1 ; } for ( int i = 1 ; i < len ; i ++ ) { for ( int j = 1 ; j < len ; j ++ ) { for ( int k = j ; k < len ; k += j ) { dp [ i ] [ k ] = ( dp [ i ] [ k ] + dp [ i - 1 ] [ j ] ) % mod ; } } } long ans = 0 ; for ( int i = 1 ; i <= n ; i ++ ) { ans += ( dp [ size ] [ i ] ) ; ans = ans % mod ; } System . out . println ( ans ) ; }   static class FastScanner {   BufferedReader br = new BufferedReader ( new InputStreamReader ( System . in ) ) ; StringTokenizer st = new StringTokenizer ( " " ) ;   String next ( ) { while ( ! st . hasMoreTokens ( ) ) { try { st = new StringTokenizer ( br . readLine ( ) ) ; } catch ( IOException e ) { e . printStackTrace ( ) ; } } return st . nextToken ( ) ; }   int nextInt ( ) { return Integer . parseInt ( next ( ) ) ; }   long nextLong ( ) {   return Long . parseLong ( next ( ) ) ; }   double nextDouble ( ) { return Double . parseDouble ( next ( ) ) ; }   String nextLine ( ) throws IOException { return br . readLine ( ) ; } }   }

n , k = map ( int , input ( ) . split ( ) ) mod = 10 ** 9 + 7 l = [ [ ] for i in range ( 2 * 10 ** 3 + 1 ) ] for i in range ( 1 , 2 * 10 ** 3 + 1 ) : for j in range ( 1 , i + 1 ) : if i % j == 0 : l [ i ] . append ( j ) dp = [ [ 0 ] * ( n + 1 ) for i in range ( k + 1 ) ] for i in range ( 1 , n + 1 ) : dp [ 1 ] [ i ] = 1 for i in range ( 2 , k + 1 ) : for j in range ( 1 , n + 1 ) : for x in l [ j ] : dp [ i ] [ j ] += dp [ i - 1 ] [ j // x ] dp [ i ] [ j ] %= modprint ( sum ( dp [ - 1 ] ) % mod ) NEW_LINE

import java . io . BufferedReader ; import java . io . IOException ; import java . io . InputStreamReader ; import java . math . BigInteger ;   import java . util . * ; import javafx . util . Pair ;   public class Main { static long mod = ( long ) ( 1e9 + 7 ) ; public static void main ( String args [ ] ) { FastScanner input = new FastScanner ( ) ; int n = input . nextInt ( ) ; int size = input . nextInt ( ) ; int len = Math . max ( n , size ) + 1 ; long dp [ ] [ ] = new long [ len ] [ len ] ; for ( int i = 1 ; i <= n ; i + + ) { dp [ 1 ] [ i ] = 1 ; } for ( int i = 1 ; i < len ; i + + ) { for ( int j = 1 ; j < len ; j + + ) { for ( int k = j ; k < len ; k += j ) { dp [ i ] [ k ] = ( dp [ i ] [ k ] + dp [ i - 1 ] [ j ] ) % mod ; } } } long ans = 0 ; for ( int i = 1 ; i <= n ; i + + ) { ans += ( dp [ size ] [ i ] ) ; ans = ans % mod ; } System . out . println ( ans ) ; }   static class FastScanner {   BufferedReader br = new BufferedReader ( new InputStreamReader ( System . in ) ) ; StringTokenizer st = new StringTokenizer ( " " ) ;   String next ( ) { while ( ! st . hasMoreTokens ( ) ) { try { st = new StringTokenizer ( br . readLine ( ) ) ; } catch ( IOException e ) { e . printStackTrace ( ) ; } } return st . nextToken ( ) ; }   int nextInt ( ) { return Integer . parseInt ( next ( ) ) ; }   long nextLong ( ) {   return Long . parseLong ( next ( ) ) ; }   double nextDouble ( ) { return Double . parseDouble ( next ( ) ) ; }   String nextLine ( ) throws IOException { return br . readLine ( ) ; } }   } NEW_LINE


import java . util . * ; import java . util . Scanner ; import java . io . * ; import javax . lang . model . util . ElementScanner6 ; import static java . lang . System . out ; import java . util . Stack ; import java . util . Queue ; import java . util . LinkedList ;   public class A803 {   public static void main ( String args [ ] ) {   FastReader in = new FastReader ( ) ; PrintWriter pr = new PrintWriter ( new BufferedWriter ( new OutputStreamWriter ( System . out ) ) ) ; int tc = 1 ;

n , k = list ( map ( int , input ( ) . split ( ) ) ) ans = Noneif ( k > n ** 2 ) : print ( - 1 ) elif ( k == n ** 2 ) : ans = [ [ 1 ] * n for arr in range ( n ) ] for i in range ( n ) : print ( " ▁ " . join ( j for j in map ( str , ans [ i ] ) ) ) elif ( k == 0 ) : ans = [ [ 0 ] * n for arr in range ( n ) ] for i in range ( n ) : print ( " ▁ " . join ( j for j in map ( str , ans [ i ] ) ) ) else : ans = [ [ 0 ] * n for arr in range ( n ) ] for i in range ( n - 1 , 0 , - 1 ) : loc = n - i - 1 k -= 1 ans [ loc ] [ loc ] = 1 if ( k >= 2 * i ) : for j in range ( loc + 1 , n ) : ans [ loc ] [ j ] = ans [ j ] [ loc ] = 1 if ( k == 2 * i ) : break k -= 2 * i else : if ( k % 2 == 1 ) : ans [ loc + 1 ] [ loc + 1 ] = 1 k -= 1 for j in range ( loc + 1 , loc + 1 + ( k // 2 ) ) : ans [ loc ] [ j ] = ans [ j ] [ loc ] = 1 break for i in range ( n ) : print ( " ▁ " . join ( j for j in map ( str , ans [ i ] ) ) ) NEW_LINE

def maximal_binary_matrix ( n , k ) : matrix = [ [ 0 ] * n for _ in range ( n ) ] for i in range ( n ) : for j in range ( i , n ) : if i == j and k >= 1 : matrix [ i ] [ j ] = 1 k -= 1 elif k >= 2 : matrix [ i ] [ j ] = 1 matrix [ j ] [ i ] = 1 k -= 2 return matrix if k == 0 else None     n , k = map ( int , input ( ) . split ( ) ) m = maximal_binary_matrix ( n , k ) if m : for row in m : print ( * row ) else : print ( - 1 ) NEW_LINE

import sysinput = sys . stdin . readline   '''   '''   def pprint ( mat ) : for r in mat : print ( " ▁ " . join ( r ) )   n , k = map ( int , input ( ) . split ( ) ) mat = [ [ "0" ] * n for _ in range ( n ) ] N = n   if n ** 2 < k : print ( - 1 ) sys . exit ( ) else : num_cells = 2 * n - 1 rc = 0 while num_cells > 0 and num_cells <= k : for x in range ( rc , N ) : mat [ x ] [ rc ] = "1" mat [ rc ] [ x ] = "1"   rc += 1 k -= num_cells n -= 1 num_cells = 2 * n - 1   if k == 0 : pprint ( mat ) sys . exit ( ) elif k % 2 == 0 : mat [ rc + 1 ] [ rc + 1 ] = "1" k -= 1   for x in range ( rc , rc + k // 2 + 1 ) : mat [ x ] [ rc ] = "1" mat [ rc ] [ x ] = "1"   pprint ( mat ) NEW_LINE


import java . util . Scanner ;   public class A1358 { public static void main ( String [ ] args ) { Scanner scanner = new Scanner ( System . in ) ;   int t = scanner . nextInt ( ) ; for ( int i = 0 ; i < t ; i ++ ) { int n = scanner . nextInt ( ) ; int m = scanner . nextInt ( ) ; int exp = n * m ; if ( exp % 2 == 0 ) { System . out . println ( exp / 2 ) ; } else { System . out . println ( ( exp + 1 ) / 2 ) ; } } } }

import java . io . BufferedReader ; import java . io . IOException ; import java . io . InputStreamReader ; import java . util . StringTokenizer ; import java . util . Arrays ; import java . util . HashMap ; import java . util . HashSet ; import java . util . LinkedList ; import java . util . List ; import java . util . Map ; import java . util . Set ;   public class Main { static class FastReader { BufferedReader br ; StringTokenizer st ; public FastReader ( ) { br = new BufferedReader ( new InputStreamReader ( System . in ) ) ; } String next ( ) { while ( st == null || ! st . hasMoreElements ( ) ) { try { st = new StringTokenizer ( br . readLine ( ) ) ; } catch ( IOException e ) { e . printStackTrace ( ) ; } } return st . nextToken ( ) ; } int nextInt ( ) { return Integer . parseInt ( next ( ) ) ; } long nextLong ( ) { return Long . parseLong ( next ( ) ) ; } double nextDouble ( ) { return Double . parseDouble ( next ( ) ) ; } String nextLine ( ) { String str = " " ; try { str = br . readLine ( ) ; } catch ( IOException e ) { e . printStackTrace ( ) ; } return str ; } }   public static void main ( String [ ] args ) { FastReader sc = new FastReader ( ) ; int t = sc . nextInt ( ) ; while ( t -- > 0 ) { int n = sc . nextInt ( ) ; int m = sc . nextInt ( ) ; System . out . println ( ( n * m ) % 2 == 0 ? ( n * m ) / 2 : ( n * m ) / 2 + 1 ) ; } } }

import java . io . BufferedReader ; import java . io . IOException ; import java . io . InputStreamReader ; import java . util . Arrays ;   public class CF1358A { public static void main ( String [ ] args ) throws IOException { BufferedReader br = new BufferedReader ( new InputStreamReader ( System . in ) ) ; int t = Integer . parseInt ( br . readLine ( ) ) ; while ( t -- > 0 ) { int [ ] a = Arrays . stream ( br . readLine ( ) . split ( " \\ s + " ) ) . mapToInt ( Integer :: parseInt ) . toArray ( ) ; System . out . println ( ( a [ 0 ] * a [ 1 ] + 1 ) / 2 ) ; } } }

t = int ( input ( ) ) for j in range ( t ) : a , b = map ( int , input ( ) . split ( ) ) print ( ( a * b + 1 ) // 2 ) NEW_LINE

import mathfor _ in range ( int ( input ( ) ) ) : n , m = map ( int , input ( ) . split ( ) ) print ( math . ceil ( n * m / 2 ) ) NEW_LINE

t = int ( input ( ' ' ) ) for i in range ( t ) : n , m = map ( int , input ( ' ' ) . split ( ) ) if ( n * m % 2 == 0 ) : print ( int ( ( n * m ) / 2 ) ) else : print ( int ( ( ( n * m ) + 1 ) / 2 ) ) NEW_LINE

for _ in range ( int ( input ( ) ) ) : n , m = map ( int , input ( ) . split ( ) ) if m % 2 : print ( m // 2 * n + n // 2 + n % 2 ) else : print ( m // 2 * n ) NEW_LINE

for _ in range ( int ( input ( ) ) ) : n , m = map ( int , input ( ) . split ( ) ) if ( n * m % 2 == 0 ) : print ( n * m // 2 ) else : print ( ( n * m - 1 ) // 2 + 1 ) NEW_LINE


import java . util . Scanner ;   public class problem91 {   public static void main ( String [ ] args ) {

import java . util . ArrayList ; import java . util . Collection ; import java . util . Collections ; import java . util . Scanner ;   public class LittleElephantAndRozdil { public static void main ( String [ ] args ) { Scanner scanner = new Scanner ( System . in ) ; int n = scanner . nextInt ( ) ; ArrayList < Integer > arrayList = new ArrayList < > ( ) ; for ( int i = 0 ; i < n ; i ++ ) { arrayList . add ( scanner . nextInt ( ) ) ; } int min = Collections . min ( arrayList ) ;

import java . util . Scanner ; import java . util . * ;    public class Main { public static void main ( String [ ] args ) { Scanner scan = new Scanner ( System . in ) ; int n = scan . nextInt ( ) ; int min = Integer . MAX_VALUE ; int count = 1 ; int index = - 1 ; for ( int i = 0 ; i < n ; i ++ ) { int r = scan . nextInt ( ) ; if ( r < min ) { index = i ; min = r ; count = 1 ; } else if ( r == min ) { count ++ ; } } if ( count > 1 ) { System . out . print ( " Still ▁ Rozdil " ) ; } else { System . out . print ( index + 1 ) ; } scan . close ( ) ; } }

import java . util . * ; import java . lang . Math ; public class Main { public static void main ( String [ ] args ) {

import sysn = int ( input ( ) ) A = list ( map ( int , input ( ) . split ( ) ) ) minn = sys . maxsizeindex = 0 count = 0 for i in range ( n ) : if A [ i ] < minn : minn = A [ i ] index = i count = 1 elif A [ i ] == minn : count += 1 if count == 1 : print ( index + 1 ) else : print ( " Still ▁ Rozdil " ) NEW_LINE

from sys import stdinfrom bisect import bisect_right as br   input = stdin . readline   n = int ( input ( ) ) lst = list ( map ( int , input ( ) . strip ( ) . split ( ) ) ) arr = sorted ( lst ) ind = br ( arr , arr [ 0 ] ) - 1 if ind == 0 : print ( lst . index ( arr [ 0 ] ) + 1 ) else : print ( ' Still ▁ Rozdil ' ) NEW_LINE

num = int ( input ( ) ) arr = list ( map ( int , input ( ) . split ( ) ) ) mn = min ( arr ) if arr . count ( mn ) > 1 : print ( " Still ▁ Rozdil " ) else : print ( arr . index ( mn ) + 1 )     NEW_LINE

n = int ( input ( ) ) a = list ( map ( int , input ( ) . split ( ) ) ) x = min ( a ) if a . count ( x ) > 1 : print ( ' Still ▁ Rozdil ' ) else : print ( a . index ( x ) + 1 ) NEW_LINE

n = int ( input ( ) ) min_idx = - 1 min_dist = float ( " inf " )   for idx , d in enumerate ( map ( int , input ( ) . split ( ) ) ) : if d == min_dist : min_idx = - 1 elif d < min_dist : min_idx = idx + 1 min_dist = min ( min_dist , d )   if min_idx >= 0 : print ( min_idx ) else : print ( " Still ▁ Rozdil " ) NEW_LINE


import java . io . BufferedReader ; import java . io . IOException ; import java . io . InputStreamReader ; import java . io . PrintWriter ; import java . util . Random ; import java . util . StringTokenizer ;   public class Main implements Runnable {   long INF = ( long ) 1e9 + 9 ;   private void solve ( ) throws IOException {

import java . io . BufferedReader ; import java . io . DataInputStream ; import java . io . IOException ; import java . io . InputStreamReader ; import java . util . * ; public class D_1296 { public static Scanner sc = new Scanner ( System . in ) ; public static long mod = 1000000000 + 9 ; public static boolean flag [ ] ; public static void main ( String [ ] args ) {   long n = sc . nextLong ( ) ; long a = sc . nextLong ( ) % mod ; long b = sc . nextLong ( ) % mod ; int k = sc . nextInt ( ) ; sc . nextLine ( ) ; long ar = quickPow ( a , mod - 2 ) ; long ans = 0 ; long ab = ar * b % mod ; long cycle = 0 ; long tmp = 1 ; long start = quickPow ( a , n ) ; String flag = sc . next ( ) ;   for ( int i = 0 ; i < k ; i ++ ) { if ( flag . charAt ( i ) == ' + ' ) cycle = ( cycle + tmp + mod ) % mod ; else cycle = ( cycle - tmp + mod ) % mod ; tmp = tmp * ab % mod ; } long cx = quickPow ( ab , k ) ;

import mathdef binpow ( a , b , m ) : a %= m res = int ( 1 ) while b > 0 : if b & 1 : res = ( res * a ) % m a = ( a * a ) % m b >>= 1 return res   def inv ( a , m : int = 1000000009 ) : return binpow ( a , m - 2 , m )   m = int ( 1000000009 )   n , a , b , k = input ( ) . split ( ) n = int ( n ) ; a = int ( a ) ; b = int ( b ) ; k = int ( k ) st = input ( ) res = int ( 1 ) p = int ( ( b * inv ( a , m ) ) % m ) itr = ( n + 1 ) // kmul1 = 0 for i in range ( len ( st ) ) : if st [ i ] == ' + ' : mul1 = ( mul1 + binpow ( p , i , m ) ) % m else : mul1 = ( mul1 - binpow ( p , i , m ) ) % mif binpow ( p , k , m ) == 1 : mul2 = itr % melse : mul2 = ( ( binpow ( p , k * itr , m ) - 1 ) * inv ( ( binpow ( p , k , m ) - 1 ) % m ) ) % mres = ( mul1 * mul2 ) % mleft = n - k * itr + 1 mul1 = binpow ( p , k * itr , m ) mul2 = 0 for i in range ( left ) : if st [ i ] == ' + ' : mul2 = ( mul2 + binpow ( p , i , m ) ) % m else : mul2 = ( mul2 - binpow ( p , i , m ) ) % mres = ( res + mul1 * mul2 ) % mres = ( res * binpow ( a , n , m ) ) % mprint ( res )     NEW_LINE

n , a , b , k = map ( int , input ( ) . split ( ) ) mod = 10 ** 9 + 9 NEW_LINE

inp = input ( " " ) . split ( ' \n ' ) nums = inp [ 0 ] . split ( ' ▁ ' )   n = int ( nums [ 0 ] ) a = int ( nums [ 1 ] ) b = int ( nums [ 2 ] ) k = int ( nums [ 3 ] )   st = str ( input ( " " ) . strip ( ) )   tot = 0 mod = 10 ** 9 + 9   def inv ( a ) : return pow ( a , mod - 2 , mod ) for i in range ( 0 , k ) : vl = 1 if ( st [ i ] == ' - ' ) : vl = - 1 tot += vl * pow ( a , n - i , mod ) * pow ( b , i , mod ) tot %= mod   mult = ( pow ( b , k , mod ) * inv ( pow ( a , k , mod ) ) ) % mod   p = ( ( n + 1 ) // k ) - 1   NEW_LINE

MOD = int ( 1e9 + 9 ) n , a , b , k = map ( int , input ( ) . split ( ) ) s = input ( )   def solve ( ) : res = 0 q = pow ( b , k , MOD ) * pow ( pow ( a , k , MOD ) , MOD - 2 , MOD ) % MOD max_pow = pow ( a , n , MOD ) c = b * pow ( a , MOD - 2 , MOD ) % MOD for i in range ( k ) : res += max_pow if s [ i ] == ' + ' else - max_pow res = ( res % MOD + MOD ) % MOD max_pow = max_pow * c % MOD t = ( n + 1 ) // k if q == 1 : return t * res % MOD z = ( pow ( q , t , MOD ) - 1 ) * pow ( q - 1 , MOD - 2 , MOD ) % MOD return z * res % MOD   print ( solve ( ) ) NEW_LINE


import java . io . * ; import java . util . * ; public class Solution { public static void main ( String [ ] args ) throws Exception { FastReader fr = new FastReader ( ) ; int t = fr . nextInt ( ) ; while ( t -- > 0 ) { int n = fr . nextInt ( ) ; int digs = 4 * n - n ; int nines = digs / 4 ; int eights = n - nines ; StringBuilder sb = new StringBuilder ( ) ; while ( nines > 0 ) { sb . append ( "9" ) ; nines -- ; } while ( eights > 0 ) { sb . append ( "8" ) ; eights -- ; } System . out . println ( sb . toString ( ) ) ; } } } class Pair implements Comparable < Pair > { int x ; int y ; Pair ( int x , int y ) { this . x = x ; this . y = y ; } public int compareTo ( Pair o ) { if ( this . x != o . x ) return this . x - o . x ; else return this . y - o . y ; } } class FastReader { BufferedReader br ; StringTokenizer st ; public FastReader ( ) { br = new BufferedReader ( new InputStreamReader ( System . in ) ) ; } String next ( ) { while ( st == null || ! st . hasMoreElements ( ) ) { try { st = new StringTokenizer ( br . readLine ( ) ) ; } catch ( IOException e ) { e . printStackTrace ( ) ; } } return st . nextToken ( ) ; } int nextInt ( ) { return Integer . parseInt ( next ( ) ) ; } long nextLong ( ) { return Long . parseLong ( next ( ) ) ; } double nextDouble ( ) { return Double . parseDouble ( next ( ) ) ; } String nextLine ( ) { String str = " " ; try { str = br . readLine ( ) ; } catch ( IOException e ) { e . printStackTrace ( ) ; } return str ; } }

import java . util . Scanner ; public class Div2B { private static int ceiling ( int a , int b ) { return ( a % b == 0 ) ? ( a / b ) : ( a / b ) + 1 ; } public static void main ( String [ ] args ) { Scanner scanner = new Scanner ( System . in ) ; int t = Integer . parseInt ( scanner . nextLine ( ) ) ; int n ; int ceil ; StringBuilder sb ; for ( int i = 0 ; i < t ; i ++ ) { n = Integer . parseInt ( scanner . nextLine ( ) ) ; ceil = ceiling ( n , 4 ) ; sb = new StringBuilder ( n ) ; for ( int j = 0 ; j < n - ceil ; j ++ ) { sb . append ( 9 ) ; } for ( int j = 0 ; j < ceil ; j ++ ) { sb . append ( 8 ) ; } System . out . println ( sb . toString ( ) ) ; } scanner . close ( ) ; } }

for _ in range ( int ( input ( ) ) ) : NEW_LINE INDENT n = int ( input ( ) ) NEW_LINE tmp = ( n + 3 ) // 4 NEW_LINE for i in range ( n - tmp ) : NEW_LINE INDENT print ( 9 , end = ' ' ) NEW_LINE DEDENT for i in range ( tmp ) : NEW_LINE INDENT print ( 8 , end = ' ' ) NEW_LINE DEDENT print ( ) NEW_LINE DEDENT

from math import * NEW_LINE import sys NEW_LINE input = sys . stdin . readline NEW_LINE a = int ( input ( ) ) NEW_LINE for x in range ( a ) : NEW_LINE INDENT b = int ( input ( ) ) NEW_LINE if b == 1 : NEW_LINE INDENT print ( 8 ) NEW_LINE DEDENT else : NEW_LINE INDENT n = ceil ( b / 4 ) NEW_LINE t = ( ( b - n ) * "9" ) + ( ( n ) * "8" ) NEW_LINE print ( t ) NEW_LINE DEDENT DEDENT

from sys import stdin , stdout , setrecursionlimit NEW_LINE from math import floor , gcd , fabs , factorial , fmod , sqrt , inf , log , log2 NEW_LINE from random import seed , randint NEW_LINE from datetime import datetime NEW_LINE from collections import defaultdict as dd , deque NEW_LINE from heapq import merge , heapify , heappop , heappush , nsmallest NEW_LINE from bisect import bisect_left as bl , bisect_right as br , bisect NEW_LINE from collections import defaultdict as dd NEW_LINE mod = pow ( 10 , 9 ) + 7 NEW_LINE mod2 = 998244353 NEW_LINE def inp ( ) : return stdin . readline ( ) . strip ( ) NEW_LINE def iinp ( ) : return int ( inp ( ) ) NEW_LINE def out ( var , end = " \n " ) : stdout . write ( str ( var ) + " \n " ) NEW_LINE def outa ( * var , end = " \n " ) : stdout . write ( ' ▁ ' . join ( map ( str , var ) ) + end ) NEW_LINE def lmp ( ) : return list ( mp ( ) ) NEW_LINE def mp ( ) : return map ( int , inp ( ) . split ( ) ) NEW_LINE def smp ( ) : return map ( str , inp ( ) . split ( ) ) NEW_LINE def l1d ( n , val = 0 ) : return [ val for i in range ( n ) ] NEW_LINE def l2d ( n , m , val = 0 ) : return [ l1d ( m , val ) for j in range ( n ) ] NEW_LINE def remadd ( x , y ) : return 1 if x % y else 0 NEW_LINE def ceil ( a , b ) : return ( a + b - 1 ) // b NEW_LINE def def_value ( ) : return 0 NEW_LINE for _ in range ( iinp ( ) ) : NEW_LINE INDENT n = iinp ( ) NEW_LINE k = ceil ( n , 4 ) NEW_LINE s = "9" * ( n - k ) + "8" * k NEW_LINE print ( s ) NEW_LINE DEDENT

import sys NEW_LINE from collections import defaultdict , deque NEW_LINE import math NEW_LINE INF = float ( ' inf ' ) NEW_LINE MOD = 10 ** 9 + 7 ; NEW_LINE read = lambda : [ int ( s ) for s in sys . stdin . readline ( ) . split ( ) ] NEW_LINE _ = 1 NEW_LINE _ = int ( input ( ) ) NEW_LINE while _ : NEW_LINE INDENT n , = read ( ) NEW_LINE n8 = math . ceil ( n / 4 ) NEW_LINE n9 = n - n8 NEW_LINE res = " " NEW_LINE for i in range ( n9 ) : NEW_LINE INDENT res += "9" NEW_LINE DEDENT for i in range ( n8 ) : NEW_LINE INDENT res += "8" NEW_LINE DEDENT print ( res ) NEW_LINE _ -= 1 NEW_LINE DEDENT


import java . util . * ; import java . io . * ;   public class Bear_and_Compressing { public static void main ( String [ ] args ) throws IOException { BufferedReader br = new BufferedReader ( new InputStreamReader ( System . in ) ) ; PrintWriter pw = new PrintWriter ( System . out ) ;   int t = 1 ;   while ( t -- > 0 ) {   String str [ ] = br . readLine ( ) . trim ( ) . split ( " ▁ " ) ; int n = Integer . parseInt ( str [ 0 ] ) ; int m = Integer . parseInt ( str [ 1 ] ) ;   HashMap < String , ArrayList < String > > mp = new HashMap < > ( ) ; ArrayList < String > temp ; for ( int i = 0 ; i < m ; i ++ ) { str = br . readLine ( ) . trim ( ) . split ( " ▁ " ) ;   if ( mp . get ( str [ 1 ] ) != null ) { temp = ( ArrayList ) mp . get ( str [ 1 ] ) ; temp . add ( str [ 0 ] ) ; mp . put ( str [ 1 ] , temp ) ; } else { temp = new ArrayList < > ( ) ; temp . add ( str [ 0 ] ) ; mp . put ( str [ 1 ] , temp ) ; } }   long ans = 0 ; LinkedList < String > q = new LinkedList < > ( ) ; LinkedList < String > p = new LinkedList < > ( ) ; q . add ( " a " ) ; while ( ! q . isEmpty ( ) ) { String x = q . poll ( ) ; int z = x . length ( ) ; if ( z == n ) { ans ++ ;

import java . util . ArrayList ; import java . util . HashMap ; import java . util . HashSet ; import java . util . List ; import java . util . Map ; import java . util . Scanner ; import java . util . Set ;   public class B653 {   public static void main ( String [ ] args ) { Scanner in = new Scanner ( System . in ) ; int N = in . nextInt ( ) ; int Q = in . nextInt ( ) ; Map < Character , List < String > > map = new HashMap < > ( ) ; for ( char c = ' a ' ; c <= ' f ' ; c ++ ) { map . put ( c , new ArrayList < > ( ) ) ; } for ( int q = 0 ; q < Q ; q ++ ) { String expansion = in . next ( ) ; String compression = in . next ( ) ; map . get ( compression . charAt ( 0 ) ) . add ( expansion ) ; } Set < String > set = new HashSet < > ( ) ; set . add ( " a " ) ; for ( int n = 2 ; n <= N ; n ++ ) { Set < String > newSet = new HashSet < > ( ) ; for ( String compression : set ) { char c = compression . charAt ( 0 ) ; for ( String expansion : map . get ( c ) ) { newSet . add ( expansion + compression . substring ( 1 ) ) ; } } set = newSet ; } System . out . println ( set . size ( ) ) ; }   }

l = [ ] n , q = map ( int , input ( ) . split ( ) ) al = [ " a " , " b " , " c " , " d " , " e " , " f " ] qu = [ ] qu . append ( ( " " , 0 ) ) while qu : s , cnt = qu . pop ( 0 ) if cnt == n : l . append ( s ) continue for i in range ( 6 ) : ss = s + al [ i ] qu . append ( ( ss , cnt + 1 ) ) l = list ( set ( l ) ) cnt = 0 item = [ input ( ) . split ( " ▁ " ) for i in range ( q ) ] def df ( s ) : global cnt if s == " a " : cnt += 1 return elif len ( s ) == 1 : return for t1 , t2 in item : if s [ 0 : 2 ] == t1 : t = t2 + s [ 2 : ] df ( t ) for s in l : df ( s ) print ( cnt ) NEW_LINE

n , q = map ( int , input ( ) . split ( ) ) from collections import defaultdict   def DFS ( d , s , t ) : if len ( s ) == t : NEW_LINE

links = [ [ ] , [ ] , [ ] , [ ] , [ ] , [ ] ] n , q = map ( int , input ( ) . split ( ) ) for _ in range ( q ) : a , b = input ( ) . split ( ) links [ ord ( b ) - ord ( ' a ' ) ] . append ( a [ 0 ] )     def func ( b , depth ) : if depth == n : return 1 count = 0 for a in links [ ord ( b ) - ord ( ' a ' ) ] : count += func ( a , depth + 1 ) return countprint ( func ( ' a ' , 1 ) ) NEW_LINE

p = [ " a " , " b " , " c " , " d " , " e " , " f " ]     def cond ( item ) : return item [ 0 ] in p and item [ 1 ] in p     def dp ( ) : arr = [ [ 0 for j in range ( 6 ) ] for i in range ( n ) ] for j in range ( 6 ) : arr [ 0 ] [ j ] = 1 for i in range ( 1 , n ) : for j in range ( 6 ) : for item in d : if cond ( item ) and d [ item ] == j : x = ord ( item [ 0 ] ) - ord ( " a " ) arr [ i ] [ j ] += arr [ i - 1 ] [ x ] return arr [ - 1 ] [ 0 ]     n , k = map ( int , input ( ) . split ( ) ) d = { } for i in range ( k ) : a , b = input ( ) . split ( ) d [ a ] = ord ( b ) - ord ( " a " ) print ( dp ( ) ) NEW_LINE

from itertools import product     def bear_and_compressing ( ) : n , q = input ( ) . split ( ) n , q = int ( n ) , int ( q ) o = [ ] j = [ ] for _ in range ( q ) : o . append ( list ( input ( ) ) ) s = list ( product ( ' abcdef ' , repeat = n ) ) for i in s : j . append ( list ( i ) ) for _ in range ( n ) : for i in j : for x in o : try : if i [ 0 ] == x [ 0 ] and i [ 1 ] == x [ 1 ] : i . pop ( 0 ) i [ 0 ] = x [ 3 ] except IndexError : continue count = j . count ( [ ' a ' ] ) print ( count )     if __name__ == ' _ _ main _ _ ' : bear_and_compressing ( )     NEW_LINE


import java . util . * ; import java . util . stream . * ;   public class BayanBus { private static final int numRowsWithoutBack = 10 ; public static void main ( String [ ] args ) { Scanner in = new Scanner ( System . in ) ; int k = in . nextInt ( ) ; System . out . println ( solve ( k ) ) ; } private static String solve ( int k ) { StringBuilder sb = new StringBuilder ( ) ; String edge = makeEdge ( numRowsWithoutBack + 2 ) ; sb . append ( edge + " \n " ) ;

numberoParticipantes = int ( input ( ) ) participantes = [ ' temp ' ] * numberoParticipantes primeraLinea = [ ] segundaLinea = [ ] terceraLinea = [ ] cuartaLinea = [ ] for k in range ( 0 , 11 ) : for l in range ( 0 , 4 ) : if ( l == 0 and len ( participantes ) > 0 ) : primeraLinea . append ( ' O ' ) participantes . pop ( 0 ) elif ( l == 1 and len ( participantes ) > 0 ) : segundaLinea . append ( ' O ' ) participantes . pop ( 0 ) elif ( k == 0 and l == 2 and len ( participantes ) > 0 ) : terceraLinea . append ( ' O ' ) participantes . pop ( 0 ) elif ( l == 3 and len ( participantes ) > 0 ) : cuartaLinea . append ( ' O ' ) participantes . pop ( 0 ) print ( ' + - - - - - - - - - - - - - - - - - - - - - - - - + ' ) for i in range ( 0 , 4 ) : for j in range ( 0 , 27 ) : if ( j == 0 or ( j == 23 and i != 2 ) or j == 25 ) : print ( ' | ' , end = ' ' ) elif ( j == 26 and ( i == 0 or i == 3 ) ) : print ( ' ) ' , end = ' ' ) elif ( j == 26 and ( i == 1 or i == 2 ) ) : print ( ' ' , end = ' ' ) elif ( j == 24 and i == 0 ) : print ( ' D ' , end = ' ' ) elif ( j % 2 == 0 or ( j > 1 and i == 2 ) ) : print ( ' . ' , end = ' ' ) elif ( i == 0 and len ( primeraLinea ) ) : print ( primeraLinea . pop ( ) , end = ' ' ) elif ( i == 1 and len ( segundaLinea ) ) : print ( segundaLinea . pop ( ) , end = ' ' ) elif ( i == 2 and len ( terceraLinea ) ) : print ( terceraLinea . pop ( ) , end = ' ' ) elif ( i == 3 and len ( cuartaLinea ) ) : print ( cuartaLinea . pop ( ) , end = ' ' ) else : print ( ' # ' , end = ' ' ) print ( ' ' ) print ( ' + - - - - - - - - - - - - - - - - - - - - - - - - + ' ) NEW_LINE

def listToStr ( arr ) : res = ' ' for i in arr : res += i   return res     def solve ( k ) : border = " + - - - - - - - - - - - - - - - - - - - - - - - - + "   row1 = list ( " | " + ( " # . " * 11 ) + " | D | ) " )   row2 = list ( " | " + ( " # . " * 11 ) + " | . | " )   row4 = list ( " | " + ( " # . " * 11 ) + " | . | ) " )   row3 = list ( " | # . . . . . . . . . . . . . . . . . . . . . . . | " )   rem = k   if rem == 1 : row1 [ 1 ] = " O " rem = 0 if rem == 2 : row1 [ 1 ] = " O " row2 [ 1 ] = " O " rem = 0 if rem == 3 : row1 [ 1 ] = " O " row2 [ 1 ] = " O " row3 [ 1 ] = " O " rem = 0   if rem == 4 : row1 [ 1 ] , row2 [ 1 ] , row3 [ 1 ] , row4 [ 1 ] = " O " , " O " , " O " , " O " rem = 0 if rem == 0 : row1 = listToStr ( row1 ) row2 = listToStr ( row2 ) row3 = listToStr ( row3 ) row4 = listToStr ( row4 ) print ( border ) print ( row1 ) print ( row2 ) print ( row3 ) print ( row4 ) print ( border ) return if rem > 4 : row1 [ 1 ] , row2 [ 1 ] , row3 [ 1 ] , row4 [ 1 ] = " O " , " O " , " O " , " O " rem -= 4 rowsPossible = rem // 3   rem = rem % 3   pos = 1   for i in range ( 1 , rowsPossible + 1 ) : pos = ( 2 * i ) + 1   row1 [ pos ] = " O " row2 [ pos ] = " O " row4 [ pos ] = " O " pos += 2   if rem == 1 : row1 [ pos ] = " O " if rem == 2 : row1 [ pos ] = " O " row2 [ pos ] = " O " row1 = listToStr ( row1 ) row2 = listToStr ( row2 ) row3 = listToStr ( row3 ) row4 = listToStr ( row4 ) print ( border ) print ( row1 ) print ( row2 ) print ( row3 ) print ( row4 ) print ( border ) return             k = int ( input ( ) )   solve ( k )   NEW_LINE