n = int ( input ( ) )   x = list ( input ( ) . split ( ) )   ans = [ ] for i in range ( n ) : y = list ( x [ i ] . strip ( ) ) y . sort ( ) y = set ( y ) y = ' ' . join ( y ) if y in ans : pass else : ans . append ( y ) print ( len ( ans ) ) NEW_LINE


import java . util . * ; import java . util . stream . * ; public class Solution { public static void main ( String [ ] args ) { Scanner scan = new Scanner ( System . in ) ; int n = scan . nextInt ( ) ; scan . nextLine ( ) ; String [ ] words = scan . nextLine ( ) . split ( " ▁ " ) ; Set < Set < Character > > roots = new HashSet < > ( ) ; for ( String w : words ) { Set < Character > root = new HashSet < > ( ) ; for ( int i = 0 ; i < w . length ( ) ; i ++ ) { root . add ( w . charAt ( i ) ) ; } roots . add ( root ) ; } System . out . println ( roots . size ( ) ) ; } }

input ( ) print ( len ( set ( map ( frozenset , input ( ) . split ( ) ) ) ) ) NEW_LINE


import java . util . * ; public class Solution { public static void main ( String [ ] args ) { Scanner s = new Scanner ( System . in ) ; int n = s . nextInt ( ) ; s . nextLine ( ) ; String s2 = s . nextLine ( ) ; String [ ] s1 = s2 . split ( " ▁ " ) ; ArrayList < String > a = new ArrayList < > ( ) ; for ( int i = 0 ; i < n ; i ++ ) { String s3 = " " ; char [ ] ch = s1 [ i ] . toCharArray ( ) ; Arrays . sort ( ch ) ; for ( int j = 0 ; j < s1 [ i ] . length ( ) ; j ++ ) { char c = ch [ j ] ; if ( s3 . indexOf ( c ) < 0 ) s3 = s3 + c ; } a . add ( s3 ) ; } HashSet < String > h = new HashSet < > ( a ) ; System . out . println ( h . size ( ) ) ; } }

n = int ( input ( ) ) s = list ( str ( input ( ) ) . split ( " ▁ " ) ) k = set ( [ frozenset ( i ) for i in s ] ) print ( len ( k ) ) NEW_LINE


if __name__ == ' _ _ main _ _ ' : n = int ( input ( ) ) l = input ( ) . split ( ) d = dict ( ) for i in l : s = sorted ( set ( i ) ) j = ' ' for i in range ( len ( s ) ) : j += s [ i ] d . setdefault ( j , 0 ) d [ j ] += 1 print ( len ( d ) ) NEW_LINE


import java . util . * ;   public class Solve {   static Scanner scan = new Scanner ( System . in ) ;   public static void solve ( long n , long m ) {   long count = 0 , temp ;   if ( m % n == 0 ) { temp = m / n ; while ( temp % 2 == 0 ) { count ++ ; temp /= 2 ; } while ( temp % 3 == 0 ) { count ++ ; temp /= 3 ; } if ( temp == 1 ) { System . out . println ( count ) ; } else { System . out . println ( - 1 ) ; } } else { System . out . println ( - 1 ) ; } }   public static void main ( String [ ] args ) {   long n = scan . nextLong ( ) ; long m = scan . nextLong ( ) ;   solve ( n , m ) ; } }

n , m = map ( int , input ( ) . split ( ) ) z = m / n NEW_LINE


n , m = map ( int , input ( ) . split ( ) ) if n == m : print ( 0 ) elif m % n != 0 : print ( - 1 ) else : s = 0 x = m // n while x % 2 == 0 or x % 3 == 0 : if x % 2 == 0 : x = x // 2 s = s + 1 if x % 3 == 0 : x = x // 3 s = s + 1 if x == 1 and s != 0 : print ( s ) else : print ( - 1 ) NEW_LINE


def solution ( n , m ) :     if m % n == 0 : t = m / n i = 0   while t > 1 :   if t % 2 == 0 : i += 1 t = t / 2 continue   elif t % 3 == 0 : i += 1 t = t / 3 continue   else : return - 1   return i else : return - 1       nd = input ( ) . split ( ) ind = list ( map ( int , nd ) ) print ( solution ( ind [ 0 ] , ind [ 1 ] ) ) NEW_LINE


n , m = map ( int , input ( ) . split ( ) ) ch = m / nk = 0 if n == m : k = 0 else : while ch != 1 : if ch % 3 == 0 : ch = ch / 3 k += 1 elif ch % 2 == 0 : ch = ch / 2 k += 1 else : k = - 1 ch = 1 print ( k ) NEW_LINE


import java . io . BufferedReader ; import java . io . IOException ; import java . io . InputStreamReader ; import static java . lang . Math . * ; import static java . lang . System . out ; import java . util . * ; import java . io . PrintStream ; import java . io . PrintWriter ; public class A { static final int N = ( int ) ( 1e5 + 100 ) ; static final int mod = 1000000007 ; static final long temp = 998244353 ; static final long MOD = 1000000007 ; static final long M = ( long ) 1e9 + 7 ; static class Pair implements Comparable < Pair > { long first , second ; public Pair ( long aa , long bb ) { first = aa ; second = bb ; } public int compareTo ( Pair o ) { return ( int ) ( o . first - this . first ) ; } } static class Tuple implements Comparable < Tuple > { long first , second , third ; public Tuple ( long first , long second , long third ) { this . first = first ; this . second = second ; this . third = third ; } public int compareTo ( Tuple o ) { return ( int ) ( o . third - this . third ) ; } } public static class DSU { int [ ] parent ; int [ ] rank ;


import java . util . * ; public class Main { public static void main ( String [ ] args ) { int n , m , sum = 0 , a ; Scanner in = new Scanner ( System . in ) ; n = in . nextInt ( ) ; m = in . nextInt ( ) ; if ( m % n != 0 ) { System . out . println ( - 1 ) ; } else { a = m / n ; while ( a % 2 == 0 || a % 3 == 0 ) { if ( a % 2 == 0 ) { sum ++ ; a = a / 2 ; } if ( a % 3 == 0 ) { sum ++ ; a = a / 3 ; } } if ( a == 1 ) { System . out . println ( sum ) ; } else System . out . println ( - 1 ) ; } }   }


import java . util . * ; public class game23 { public static void main ( String [ ] args ) { Scanner sc = new Scanner ( System . in ) ; int n = sc . nextInt ( ) ; int x = sc . nextInt ( ) ; int c = 0 ; while ( n < x ) { if ( x % ( 3 * n ) == 0 ) { n *= 3 ; ++ c ; } else if ( x % ( 2 * n ) == 0 ) { n *= 2 ; ++ c ; } else { System . out . print ( - 1 ) ; return ; } } System . out . print ( c ) ; } }


import java . util . * ; public class Omkar_and_Password { public static void main ( String [ ] args ) { Scanner sc = new Scanner ( System . in ) ; int t = sc . nextInt ( ) ; while ( t -- > 0 ) { int n = sc . nextInt ( ) ; int y = sc . nextInt ( ) ; int c = 0 , sum = y ; for ( int i = 1 ; i < n ; i ++ ) { int x = sc . nextInt ( ) ; if ( x != sum ) { sum = sum + x ; c ++ ; } } if ( c > 0 ) System . out . println ( 1 ) ; else System . out . println ( n ) ; } } }

from collections import Counter NEW_LINE t = int ( input ( ) ) NEW_LINE for _ in range ( t ) : NEW_LINE INDENT n = int ( input ( ) ) NEW_LINE ali = list ( map ( int , input ( ) . split ( ) ) ) NEW_LINE q = ali . count ( ali [ 0 ] ) NEW_LINE if ( q == n ) : NEW_LINE INDENT print ( n ) NEW_LINE DEDENT else : NEW_LINE INDENT print ( 1 ) NEW_LINE DEDENT DEDENT


for s in [ * open ( 0 ) ] [ 2 : : 2 ] : s = s . split ( ) ; print ( [ 1 , len ( s ) ] [ len ( { * s } ) < 2 ] ) NEW_LINE


for i in range ( int ( input ( ) ) ) : NEW_LINE INDENT n = int ( input ( ) ) NEW_LINE l = list ( map ( int , input ( ) . split ( ) ) ) NEW_LINE if ( min ( l ) == max ( l ) ) : NEW_LINE INDENT print ( n ) NEW_LINE DEDENT else : NEW_LINE INDENT print ( 1 ) NEW_LINE DEDENT DEDENT


from itertools import accumulate as ac NEW_LINE from collections import Counter as cc NEW_LINE from bisect import bisect_left as bsl NEW_LINE from bisect import bisect as bs NEW_LINE from math import factorial as f NEW_LINE from collections import * NEW_LINE from itertools import * NEW_LINE from string import * NEW_LINE from bisect import * NEW_LINE from queue import * NEW_LINE from heapq import * NEW_LINE from math import * NEW_LINE from sys import * NEW_LINE from re import * NEW_LINE def fast ( ) : return stdin . readline ( ) . strip ( ) NEW_LINE def zzz ( ) : return [ int ( i ) for i in fast ( ) . split ( ) ] NEW_LINE z , zz = input , lambda : list ( map ( int , z ( ) . split ( ) ) ) NEW_LINE szz , graph , mod , szzz = lambda : sorted ( zz ( ) ) , { } , 10 ** 9 + 7 , lambda : sorted ( zzz ( ) ) NEW_LINE def lcd ( xnum1 , xnum2 ) : return ( xnum1 * xnum2 // gcd ( xnum1 , xnum2 ) ) NEW_LINE def output ( answer ) : stdout . write ( str ( answer ) ) NEW_LINE num = int ( z ( ) ) NEW_LINE for _ in range ( num ) : NEW_LINE INDENT n = int ( z ( ) ) NEW_LINE arr = szzz ( ) NEW_LINE if arr [ 0 ] == arr [ - 1 ] : NEW_LINE INDENT print ( n ) NEW_LINE DEDENT else : NEW_LINE INDENT print ( 1 ) NEW_LINE DEDENT DEDENT


import java . util . * ; public class OmkarAndPassword { public static void main ( String [ ] args ) { Scanner sc = new Scanner ( System . in ) ; int t = sc . nextInt ( ) ; while ( t -- > 0 ) { int n = sc . nextInt ( ) ; int c = 0 , a [ ] = new int [ n ] ; for ( int i = 0 ; i < n ; i ++ ) { a [ i ] = sc . nextInt ( ) ; if ( i > 0 && a [ i ] != a [ i - 1 ] ) c ++ ; } if ( c > 0 ) System . out . println ( 1 ) ; else System . out . println ( n ) ; } } }


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 t = in . nextInt ( ) ; while ( t -- > 0 ) { int n = in . nextInt ( ) ; int a [ ] = new int [ n ] ; int c = 0 ; for ( int i = 0 ; i < n ; i ++ ) { a [ i ] = in . nextInt ( ) ; if ( i > 0 && a [ i ] != a [ i - 1 ] ) c ++ ; } if ( c > 0 ) so . println ( "1" ) ; else so . println ( n ) ; } 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 . io . BufferedReader ; import java . io . IOException ; import java . io . InputStreamReader ; import java . util . ArrayList ; import java . util . Collections ; import java . util . HashSet ; import java . util . StringTokenizer ; public class A { public static void main ( String [ ] args ) { FastScanner fs = new FastScanner ( ) ; int t = fs . nextInt ( ) ; while ( t -- > 0 ) { int n = fs . nextInt ( ) ; HashSet < Integer > a = new HashSet < > ( ) ; int ans = 1 ; for ( int i = 0 ; i < n ; i ++ ) { int b = fs . nextInt ( ) ; a . add ( b ) ; } if ( a . size ( ) == 1 ) ans = 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 ( ) ) ; } int [ ] readArray ( 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 ( ) ) ; } } }


import java . util . * ; import javafx . util . Pair ;   public class practice { public static void main ( String [ ] args ) { Scanner scn = new Scanner ( System . in ) ; long n = scn . nextLong ( ) , a , b , c , val = 1 ; String l , r ; HashMap < String , Long > map = new HashMap < > ( ) ; HashMap < Pair , Long > like = new HashMap < > ( ) ; for ( int i = 0 ; i < n ; i ++ ) { l = scn . next ( ) ; r = scn . next ( ) ; r = scn . next ( ) ; if ( map . containsKey ( l ) == false ) map . put ( l , val ++ ) ; if ( map . containsKey ( r ) == false ) map . put ( r , val ++ ) ; like . put ( new Pair ( map . get ( l ) , map . get ( r ) ) , ( long ) 1 ) ; } a = scn . nextLong ( ) ; b = scn . nextLong ( ) ; c = scn . nextLong ( ) ; long t = 2187 , min = a + b + c , max = 0 ;

from itertools import product , permutations , combinationsn = int ( input ( ) ) NEW_LINE names = { } NEW_LINE nex = 0 NEW_LINE mama = 128 l NEW_LINE iking = [ 0 ] * mamalikes = [ [ 0 ] * 7 for _ in range ( 7 ) ] NEW_LINE def getName ( name ) : global nex NEW_LINE if name in names : return names [ name ] NEW_LINE names [ name ] = nex NEW_LINE nex += 1 NEW_LINE return names [ name ] NEW_LINE for _ in range ( n ) : a , b , c = input ( ) . split ( ) NEW_LINE likes [ getName ( a ) ] [ getName ( c ) ] = 1 NEW_LINE bosses = [ int ( x ) for x in input ( ) . split ( ) ] NEW_LINE part = [ ( 0 , 0 , 0 ) ] NEW_LINE dipart = 10 ** 10 NEW_LINE for i in range ( 1 , 4 ) : for NEW_LINE j in range ( i , 7 ) : k = 7 - i - j NEW_LINE if k < j : continue NEW_LINE for per in permutations ( bosses ) : aa = ( per [ 0 ] // i , per [ 1 ] // j , per [ 2 ] // k ) NEW_LINE difi = max ( aa ) - min ( aa ) NEW_LINE if difi < dipart : dipart = difi NEW_LINE part = [ ( i , j , k ) ] elif difi == dipart : part . append ( ( i , j , k ) ) NEW_LINE


import mathimport NEW_LINE itertools   if __name__ == ' _ _ main _ _ ' : N = int ( input ( ) ) NEW_LINE likes = [ input ( ) for i in range ( N ) ] NEW_LINE likes = [ line . split ( ) for line in likes ] NEW_LINE likes = [ ( words [ 0 ] , words [ 2 ] ) for words in likes ] NEW_LINE a , b , c = ( float ( val ) for val in input ( ) . split ( ) )   min_diff = max ( a , b , c ) NEW_LINE possible_groups = [ ] NEW_LINE for i in range ( 1 , 7 - 1 ) : for NEW_LINE j in range ( 1 , 7 - i ) : a_e = math . floor ( a / i ) NEW_LINE b_e = math . floor ( b / j ) NEW_LINE c_e = math . floor ( c / ( 7 - i - j ) ) NEW_LINE diff = max ( a_e , b_e , c_e ) - min ( a_e , b_e , c_e ) NEW_LINE if diff < min_diff : min_diff = diff NEW_LINE possible_groups = [ ( i , j ) ] elif diff == min_diff : possible_groups . append ( ( i , j ) ) NEW_LINE max_likes = 0 NEW_LINE for order in itertools . permutations ( [ ' Anka ' , ' Chapay ' , ' Cleo ' , ' Troll ' , ' Dracul ' , ' Snowy ' , ' Hexadecimal ' ] ) : for NEW_LINE i , j in possible_groups : likes_count = 0 NEW_LINE seta = set ( order [ : i ] ) NEW_LINE setb = set ( order [ i : ( i + j ) ] ) NEW_LINE setc = set ( order [ ( i + j ) : ] ) NEW_LINE for p , q in likes : if NEW_LINE p in seta and q in seta : likes_count += 1 NEW_LINE if p in setb and q in setb : likes_count += 1 NEW_LINE if p in setc and q in setc : likes_count += 1 NEW_LINE max_likes = max ( max_likes , likes_count ) NEW_LINE print ( f ' { min _ diff } ▁ { max _ likes } ' )   NEW_LINE


# include < stdio . h > # include < string . h > # include < math . h > # include < stdlib . h > # include < stdio . h > # include < string . h > # include < math . h > # include < stdlib . h > int min ( int a , int b ) { return ( a < b ) ? a : b ; } int max ( int a , int b ) { return ( b < a ) ? a : b ; } int n , a , b , c , k [ 100 ] [ 3 ] , kCnt = 0 , r = - 1 , arr [ 10 ] [ 10 ] , maxHappy = 0 ; int gr [ 3 ] [ 10 ] , s [ 3 ] ; void rec ( int warrior , int grouping ) { for ( int i = 0 ; i < 3 ; i ++ ) { if ( s [ i ] == k [ grouping ] [ i ] ) continue ; gr [ i ] [ s [ i ] ++ ] = warrior ; if ( warrior == 7 ) { int happy = 0 ; for ( int g = 0 ; g < 3 ; g ++ ) for ( int x = 0 ; x < s [ g ] ; x ++ ) for ( int y = 0 ; y < s [ g ] ; y ++ ) happy += arr [ gr [ g ] [ x ] ] [ gr [ g ] [ y ] ] ; if ( happy > maxHappy ) maxHappy = happy ; } else { rec ( warrior + 1 , grouping ) ; } s [ i ] -- ; } } int main ( ) {


import java . util . Scanner ;   public class Heroes { static boolean [ ] [ ] like = new boolean [ 7 ] [ 7 ] ;   static int [ ] [ ] mindiv = new int [ 3 ] [ 500 ] ; static int max = 0 ; static int divs = 0 ; static int id ( String name ) { if ( name . equals ( " Anka " ) ) return 0 ; else if ( name . equals ( " Chapay " ) ) return 1 ; else if ( name . equals ( " Cleo " ) ) return 2 ; else if ( name . equals ( " Troll " ) ) return 3 ; else if ( name . equals ( " Dracul " ) ) return 4 ; else if ( name . equals ( " Snowy " ) ) return 5 ; else if ( name . equals ( " Hexadecimal " ) ) return 6 ; return - 1 ; } static void rec ( int mem , String cur , boolean [ ] yip , int div ) { boolean debug = false ;


import java . io . BufferedReader ; import java . io . IOException ; import java . io . InputStreamReader ; import java . io . PrintWriter ; import java . util . ArrayList ; import java . util . Collections ; import java . util . StringTokenizer ; public class RemoveDuplicates { public static void main ( String [ ] args ) { FastScanner fs = new FastScanner ( ) ; int T = 1 ; PrintWriter out = new PrintWriter ( System . out ) ; for ( int tt = 0 ; tt < T ; tt ++ ) { int n = fs . nextInt ( ) ; int arr [ ] = fs . readArray ( n ) ; int count [ ] = new int [ 1001 ] ; ArrayList < Integer > ans = new ArrayList < > ( ) ; for ( int i = n - 1 ; i >= 0 ; i -- ) { count [ arr [ i ] ] ++ ; if ( count [ arr [ i ] ] == 1 ) ans . add ( arr [ i ] ) ; } System . out . println ( ans . size ( ) ) ; Collections . reverse ( ans ) ; for ( int i : ans ) { System . out . print ( i + " ▁ " ) ; } System . out . println ( ) ; } out . close ( ) ; } static class FastScanner { BufferedReader br = new BufferedReader ( new InputStreamReader ( System . in ) ) ; StringTokenizer st = new StringTokenizer ( " " ) ; public String next ( ) { while ( ! st . hasMoreElements ( ) ) try { st = new StringTokenizer ( br . readLine ( ) ) ; } catch ( IOException e ) { e . printStackTrace ( ) ; } return st . nextToken ( ) ; } int [ ] readArray ( int n ) { int [ ] a = new int [ n ] ; for ( int i = 0 ; i < n ; i ++ ) a [ i ] = nextInt ( ) ; return a ; } int nextInt ( ) { return Integer . parseInt ( next ( ) ) ; } } }

from collections import Counter   n = int ( input ( ) )   arr = [ int ( i ) for i in input ( ) . split ( ) ] c = Counter ( arr )   for i in range ( len ( arr ) ) : if c [ arr [ i ] ] > 1 : c [ arr [ i ] ] -= 1 arr [ i ] = - 1   print ( len ( c ) )   for i in arr : if i != - 1 : print ( i , end = ' ▁ ' ) NEW_LINE


n = int ( input ( ) ) lst = list ( map ( int , input ( ) . split ( ) ) ) ans = [ ] lst = lst [ : : - 1 ] for i in lst : if i not in ans : ans . append ( i ) ans = ans [ : : - 1 ] print ( len ( ans ) ) for i in ans : print ( i , end = " ▁ " ) NEW_LINE


T = int ( input ( ) ) arr = list ( map ( int , input ( ) . split ( ) [ : T ] ) ) no_dupe = [ ] for i in range ( len ( arr ) ) : if arr [ i ] in no_dupe : no_dupe . remove ( arr [ i ] ) no_dupe . append ( arr [ i ] ) print ( len ( no_dupe ) ) print ( " ▁ " . join ( map ( str , no_dupe ) ) ) NEW_LINE


import java . util . * ; public class cc { public static void main ( String [ ] args ) { Scanner sc = new Scanner ( System . in ) ; int n = sc . nextInt ( ) ; ArrayList < Integer > a = new ArrayList < > ( ) ; for ( int i = 0 ; i < n ; i ++ ) a . add ( sc . nextInt ( ) ) ; Collections . reverse ( a ) ; Set < Integer > s = new LinkedHashSet < Integer > ( ) ; s . addAll ( a ) ; a . clear ( ) ; a . addAll ( s ) ; Collections . reverse ( a ) ; s . clear ( ) ; s . addAll ( a ) ; Iterator < Integer > i = s . iterator ( ) ; System . out . println ( s . size ( ) ) ; while ( i . hasNext ( ) ) { System . out . print ( i . next ( ) + " ▁ " ) ; } } }


import java . util . ArrayList ; import java . util . Scanner ;   public class duplicates {   public static void main ( String [ ] args ) { Scanner userInput = new Scanner ( System . in ) ; int n = userInput . nextInt ( ) ; int in [ ] = new int [ n ] ; ArrayList < Integer > out = new ArrayList < Integer > ( ) ; for ( int i = 0 ; i < n ; i ++ ) { in [ i ] = userInput . nextInt ( ) ; } for ( int i = n - 1 ; i >= 0 ; i -- ) { if ( out . contains ( in [ i ] ) ) continue ; out . add ( 0 , in [ i ] ) ; } System . out . println ( out . size ( ) ) ; for ( Integer integer : out ) { System . out . print ( integer + " ▁ " ) ; } }   }


import java . util . * ; public class MyClass { 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 ( ) ; } LinkedHashSet h = new LinkedHashSet ( ) ; int [ ] arr1 = new int [ n ] ; int k = 0 ; for ( int i = n - 1 ; i >= 0 ; i -- ) { arr1 [ k ] = arr [ i ] ; k ++ ; } for ( int i = 0 ; i < n ; i ++ ) { if ( ! h . contains ( arr1 [ i ] ) ) h . add ( arr1 [ i ] ) ; } ArrayList < Integer > w = new ArrayList < Integer > ( h ) ; Collections . reverse ( w ) ; System . out . println ( w . size ( ) ) ; for ( int i : w ) System . out . print ( i + " ▁ " ) ; } }


import java . util . * ;   public class codeforces { public static void main ( String [ ] args ) { Scanner sc = new Scanner ( System . in ) ;   int n = sc . nextInt ( ) ; int [ ] arr = new int [ n ] ;     int max = 0 ; for ( int i = 0 ; i < n ; i ++ ) { arr [ i ] = sc . nextInt ( ) ; max = Math . max ( max , arr [ i ] ) ; } boolean [ ] bool = new boolean [ max + 1 ] ;   int [ ] indicies = new int [ max + 1 ] ; for ( int i = 0 ; i < n ; i ++ ) { if ( bool [ arr [ i ] ] == false ) { bool [ arr [ i ] ] = true ; indicies [ arr [ i ] ] = i ; } else { arr [ indicies [ arr [ i ] ] ] = - 1 ; indicies [ arr [ i ] ] = i ; } } int counter = 0 ; for ( int i = 0 ; i < n ; i ++ ) { if ( arr [ i ] != - 1 ) { counter ++ ; } } System . out . println ( counter ) ; for ( int i = 0 ; i < n ; i ++ ) { if ( arr [ i ] != - 1 ) { System . out . print ( arr [ i ] + " ▁ " ) ; } }    } }


import java . util . Scanner ; public class Main { public static void main ( String args [ ] ) { Scanner s = new Scanner ( System . in ) ; int t = s . nextInt ( ) ; while ( t -- != 0 ) { long n = s . nextLong ( ) ; long k = s . nextLong ( ) ; long times = n / k ; long ans = times * k ; long rem = n - ans ; ans += Math . min ( k / 2 , rem ) ; System . out . println ( ans ) ; } } }

for _ in range ( int ( input ( ) ) ) : n , k = map ( int , input ( ) . split ( ) ) print ( min ( n // k * ( k // 2 + ( k % 2 == 1 ) ) + ( n // k + 1 ) * ( k // 2 ) , n ) ) NEW_LINE


import sysinput = sys . stdin . readline   t = int ( input ( ) ) for _ in range ( t ) : n , k = map ( int , input ( ) . split ( ) ) a = n // k ans = min ( n , a * k + k // 2 ) print ( ans ) NEW_LINE


for _ in range ( int ( input ( ) ) ) : n , k = map ( int , input ( ) . split ( ) ) res = 0 if n == 1 : print ( 1 ) elif n % k == 0 : print ( n ) else : tmp = n // k st = k // 2 n = n % k ex = min ( n , st ) res = ( tmp * k ) + ex print ( res )   NEW_LINE


cases = int ( input ( ) ) while cases : cases -= 1 NEW_LINE


import com . sun . security . jgss . GSSUtil ;   import java . lang . reflect . Array ; import java . math . BigInteger ; import java . util . * ;   public class Example { public static void main ( String [ ] args ) {   Scanner sc = new Scanner ( System . in ) ; int t = sc . nextInt ( ) ; while ( t > 0 ) { int n = sc . nextInt ( ) ;   int k = sc . nextInt ( ) ; if ( n % k == 0 ) { System . out . println ( n ) ; } else { int perk = n / k ; long ans = 0 ; int aex = ( int ) Math . floor ( ( double ) k / 2 ) ; if ( aex <= n % k ) { ans = perk * k + aex ; } else { ans = perk * k + n % k ; } System . out . println ( ans ) ;   } t -- ;      }   } }


import java . util . Arrays ; import java . util . Scanner ;   public class Candies { public static void main ( String [ ] args ) { Scanner sc = new Scanner ( System . in ) ; int testcases = sc . nextInt ( ) ; sc . nextLine ( ) ;   for ( int i = 0 ; i < testcases ; i ++ ) { String array = sc . nextLine ( ) ; int [ ] stream = Arrays . stream ( array . split ( " ▁ " ) ) . mapToInt ( Integer :: parseInt ) . toArray ( ) ; System . out . println ( output ( stream ) ) ; } }   private static int output ( int [ ] stream ) { int out = 0 ; int a = stream [ 0 ] / stream [ 1 ] ; int left = stream [ 0 ] - ( stream [ 1 ] * a ) ; if ( left > stream [ 1 ] / 2 ) { left = stream [ 1 ] / 2 ; } return stream [ 1 ] * a + left ; } }


import java . io . BufferedReader ; import java . io . IOException ; import java . io . InputStreamReader ; import java . math . BigInteger ; import java . util . * ;    public class Template { private static BufferedReader input = new BufferedReader ( new InputStreamReader ( System . in ) ) ; static String readln ( ) throws IOException { String line = input . readLine ( ) ; return line ; }   public static void main ( String [ ] args ) throws IOException {

n = int ( input ( ) )   for i in range ( n * n // 2 ) : print ( i + 1 , n * n - i ) NEW_LINE


n = int ( input ( ) ) for i in range ( 1 , ( n * n ) // 2 + 1 ) : print ( i , ( n * n - i + 1 ) ) NEW_LINE


n = int ( input ( ) ) li = [ [ ] for _ in range ( n ) ] for i in range ( 1 , n * n // 2 + 1 ) : li [ ( i - 1 ) % n ] += [ i , n * n - i + 1 ] for line in li : print ( * line ) NEW_LINE


n = int ( input ( ) ) sq = n * nfor i in range ( 0 , int ( sq / 2 ) ) : print ( i + 1 , sq - i ) NEW_LINE


n = int ( input ( ) . strip ( ) ) for i in range ( n ) : a = [ ] for j in range ( n ) : a += [ j * n + ( j + i ) % n + 1 ] print ( * a ) NEW_LINE


import java . util . Scanner ; public class Cf { public static void main ( String [ ] args ) { Scanner input = new Scanner ( System . in ) ; int n = input . nextInt ( ) ; int totalbags = n * n ; for ( int i = 1 ; i <= totalbags / 2 ; i ++ ) { System . out . println ( i + " ▁ " + ( ( totalbags - i ) + 1 ) ) ; } } }


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


import java . util . * ; import java . io . * ; public class A { static FastReader in = new FastReader ( ) ; static final Random random = new Random ( ) ; static long mod = 1000000007L ; public static void main ( String args [ ] ) throws IOException { int t = 1 ;


import java . util . * ; public class Ideone { public static void main ( String [ ] args ) { Scanner in = new Scanner ( System . in ) ; int a = in . nextInt ( ) , b = in . nextInt ( ) ; if ( a < b ) System . out . print ( - 1 ) ; else System . out . printf ( " % .10f " , 1.0 * ( a + b ) / ( 2.0 * ( ( a + b ) / ( 2 * b ) ) ) ) ; } }

def solve ( a , b ) :   if b > a : return - 1   if a == b : return a u = 2 * int ( ( a + b ) / ( 2 * b ) ) sol1 = ( a + b ) / u return sol1     if __name__ == ' _ _ main _ _ ' : a , b = map ( int , input ( ) . split ( ) ) result = solve ( a , b ) print ( result ) NEW_LINE


a , b = map ( int , input ( ) . split ( ) ) if a < b : print ( - 1 ) elif a == b : print ( a ) else : i1 = ( a + b ) // ( 2 * b ) i2 = ( a - b ) // ( 2 * b ) if i2 == 0 : print ( ( a + b ) / ( 2 * i1 ) ) else : p = ( a + b ) / 2 q = ( a - b ) / 2 print ( min ( p / i1 , q / i2 ) ) NEW_LINE


def solve ( a , b ) :   if b > a : return - 1   if a == b : return a   sol1 = ( a + b ) / ( 2 * int ( ( a + b ) / ( 2 * b ) ) ) u = ( 2 * int ( ( a - b ) / ( 2 * b ) ) ) sol2 = ( a - b ) / u if u != 0 else sol1 + 1 return min ( sol1 , sol2 )     if __name__ == ' _ _ main _ _ ' : a , b = map ( int , input ( ) . split ( ) ) result = solve ( a , b ) print ( result ) NEW_LINE


import java . io . PrintWriter ; import java . util . Scanner ;   public class H { public static void main ( String [ ] args ) { Scanner sc = new Scanner ( System . in ) ; PrintWriter out = new PrintWriter ( System . out ) ; int a = sc . nextInt ( ) , b = sc . nextInt ( ) ; if ( b > a ) out . println ( - 1 ) ; else if ( a == b ) out . println ( a ) ; else { double r = ( a + b ) / 2.0 ; double r2 = ( a - b ) / 2.0 ; double k = Math . floor ( ( a + b ) / ( 2.0 * b ) ) ; double k2 = Math . floor ( ( a - b ) / ( 2.0 * b ) ) ; out . println ( Math . min ( r / k , r2 / k2 ) ) ; } out . close ( ) ; } }


import java . io . OutputStream ; import java . io . IOException ; import java . io . InputStream ; import java . io . PrintWriter ; import java . util . StringTokenizer ; import java . io . IOException ; import java . io . BufferedReader ; import java . io . InputStreamReader ; import java . io . InputStream ;   public class Main { public static void main ( String [ ] args ) { InputStream inputStream = System . in ; OutputStream outputStream = System . out ; InputReader in = new InputReader ( inputStream ) ; PrintWriter out = new PrintWriter ( outputStream ) ; AAProblemAboutPolyline solver = new AAProblemAboutPolyline ( ) ; solver . solve ( 1 , in , out ) ; out . close ( ) ; }   static class AAProblemAboutPolyline { public void solve ( int testNumber , InputReader in , PrintWriter out ) { int a = in . nextInt ( ) , b = in . nextInt ( ) ;   if ( b > a ) { out . println ( - 1 ) ; return ; }


import java . io . BufferedReader ; import java . io . IOException ; import java . io . InputStreamReader ; import java . io . OutputStreamWriter ; import java . io . PrintWriter ;   import java . util . * ;   public class A_GENERAL {

n = int ( input ( ) ) p = [ int ( i ) for i in input ( ) . split ( ) ] zeros = [ int ( i ) for i in input ( ) . split ( ) ]   ans = 0   if not sum ( zeros ) % 2 : ans += 1   visited = [ False for i in range ( n ) ]   ciclos = 0 for i in range ( n ) : if not visited [ i ] : ciclos += 1 j = i while not visited [ j ] : visited [ j ] = True j = p [ j ] - 1   if ciclos == 1 : ans += 0 else : ans += ciclos   print ( ans ) NEW_LINE


n = int ( input ( ) ) p = [ int ( i ) for i in input ( ) . split ( ) ] b = [ int ( i ) for i in input ( ) . split ( ) ] ans = 0 visited = [ False for i in range ( n ) ] for i in range ( n ) : if visited [ i ] : continue ans += 1 while not visited [ i ] : visited [ i ] = True i = p [ i ] - 1 if ans == 1 : ans = 0 ans += ( sum ( b ) + 1 ) % 2 print ( ans ) NEW_LINE


read = lambda : map ( int , input ( ) . split ( ) )   n = int ( input ( ) )   p = list ( read ( ) )   b = list ( read ( ) )   ans = ( b . count ( 1 ) + 1 ) % 2   was = [ 0 ] * n   cnt = 0   for i in range ( n ) :   if not was [ i ] :   cnt += 1   v = i   while not was [ v ] :   was [ v ] = 1   v = p [ v ] - 1   if cnt > 1 : ans += cnt   print ( ans )       NEW_LINE


import sys n = int ( input ( ) ) p = [ int ( i ) for i in input ( ) . split ( ) ] b = [ int ( i ) for i in input ( ) . split ( ) ] ans = 0 num_cycles = 0 checked = set ( ) for i in range ( n ) : if i in checked : continue checked . add ( i ) nxt = p [ i ] - 1 while nxt != i : checked . add ( nxt ) nxt = p [ nxt ] - 1 num_cycles += 1 ans += num_cycles if num_cycles != 1 else 0 ans += ( sum ( b ) % 2 ) == 0 print ( ans ) NEW_LINE


import java . util . Scanner ;   public class Main { static Scanner scanner = new Scanner ( System . in ) ; static boolean mark [ ] ; static int a [ ] ; static int n ; public static void main ( String [ ] args ) { n = scanner . nextInt ( ) ; a = new int [ n ] ; int b [ ] = new int [ n ] ; mark = new boolean [ n ] ; for ( int i = 0 ; i < n ; i ++ ) { a [ i ] = scanner . nextInt ( ) - 1 ; } int sum = 0 ; int ans = 0 ; for ( int i = 0 ; i < n ; i ++ ) { b [ i ] = scanner . nextInt ( ) ; sum += b [ i ] ; } if ( sum % 2 == 0 ) { ans = 1 ; } int low = sDFS ( ) ; if ( low == 1 ) { System . out . println ( ans ) ; return ; } System . out . println ( low + ans ) ; } private static int sDFS ( ) { int sum = 0 ; for ( int i = 0 ; i < n ; i ++ ) { if ( ! mark [ i ] ) { sum ++ ; DFS ( i ) ; } } return sum ; } private static void DFS ( int x ) { mark [ x ] = true ; if ( ! mark [ a [ x ] ] ) { DFS ( a [ x ] ) ; } } }


import java . util . * ;   public class Barbecue { public static class Graph { public int V ; ArrayList < Integer > adjList [ ] ; public Graph ( int V ) { this . V = V ; adjList = new ArrayList [ V ] ;   for ( int i = 0 ; i < V ; i ++ ) { adjList [ i ] = new ArrayList < Integer > ( ) ; } } public void addEdge ( int src , int dest , boolean bidirectional ) { this . adjList [ src ] . add ( dest ) ; if ( bidirectional ) { this . adjList [ dest ] . add ( src ) ; } } public void printGraph ( ) { for ( int v = 0 ; v < this . V ; v ++ ) { System . out . println ( " Vertex ▁ " + v + " : " ) ; System . out . print ( " Conntected ▁ to ▁ " ) ; for ( Integer pCrawl : this . adjList [ v ] ) { System . out . print ( pCrawl + " ▁ " ) ; } System . out . println ( " \n " ) ; } } public boolean dfs ( int s , boolean [ ] visited , boolean [ ] recStack ) { if ( recStack [ s ] ) return true ; if ( visited [ s ] ) return false ; visited [ s ] = true ; recStack [ s ] = true ;


import java . util . Arrays ; import java . util . Scanner ;   public class PavelAndBarbeque { public static void main ( String [ ] args ) { Scanner sc = new Scanner ( System . in ) ; sc . nextLine ( ) ;


# include < cstdio > # include < algorithm > # include < queue > # include < set > # include < cstring >   using namespace std ;   typedef long long ll ; typedef pair < ll , int > pli ; const ll P = 1e9 + 7 ; const int N = 3e5 + 10 ;  # define mk make_pair # define pb push_back # define fr first # define sc second    int rd ( ) { int x = 0 , f = 1 ; char c = getchar ( ) ; while ( c > '9' || c < '0' ) f = c == ' - ' ? - 1 : 1 , c = getchar ( ) ; while ( c >= '0' && c <= '9' ) x = x * 10 + c - 48 , c = getchar ( ) ; return x * f ; }   int n , cnt , sl , sr , sum [ N ] ; char s [ N ] , tmp [ N ] ; int main ( ) {

n = int ( input ( ) ) s = input ( ) r = 0 l = n - 1 root = [ ] buf = [ ] to_the_right = True for count in range ( n ) : if to_the_right : i = r r += 1 else : i = l l -= 1 b = s [ i ] if b == ' ( ' : if len ( buf ) == 0 or buf [ - 1 ] [ 0 ] != - 1 : buf . append ( [ - 1 , - 1 , [ ] ] ) buf [ - 1 ] [ 0 ] = i else : if len ( buf ) == 0 or buf [ - 1 ] [ 1 ] != - 1 : buf . append ( [ - 1 , - 1 , root ] ) root = [ ] to_the_right = False buf [ - 1 ] [ 1 ] = i if buf [ - 1 ] [ 0 ] != - 1 and buf [ - 1 ] [ 1 ] != - 1 : tmp = buf . pop ( ) if len ( buf ) : buf [ - 1 ] [ 2 ] . append ( tmp ) else : root . append ( tmp ) to_the_right = True sol = [ [ 0 , 1 , 1 ] ] if len ( buf ) == 0 : sol . append ( [ len ( root ) , 1 , 1 ] ) for child in root : sol . append ( [ len ( child [ 2 ] ) + 1 , child [ 0 ] + 1 , child [ 1 ] + 1 ] ) for gr_child in child [ 2 ] : sol . append ( [ len ( root ) + len ( gr_child [ 2 ] ) + 1 , gr_child [ 0 ] + 1 , gr_child [ 1 ] + 1 ] ) print ( ' % d \n % d ▁ % d ' % tuple ( max ( sol ) ) ) NEW_LINE


n = int ( input ( ) ) s = input ( ) r = 0 l = n - 1 root = [ ] buf = [ ] to_the_right = True   for count in range ( n ) : if to_the_right : i = r r += 1 else : i = l l -= 1 b = s [ i ]   if b == ' ( ' : if len ( buf ) == 0 or buf [ - 1 ] [ 0 ] != - 1 : buf . append ( [ - 1 , - 1 , [ ] ] ) buf [ - 1 ] [ 0 ] = i else : if len ( buf ) == 0 or buf [ - 1 ] [ 1 ] != - 1 : buf . append ( [ - 1 , - 1 , root ] ) root = [ ] to_the_right = False buf [ - 1 ] [ 1 ] = i if buf [ - 1 ] [ 0 ] != - 1 and buf [ - 1 ] [ 1 ] != - 1 : tmp = buf . pop ( ) if len ( buf ) : buf [ - 1 ] [ 2 ] . append ( tmp ) else : root . append ( tmp ) to_the_right = True   sol = [ [ 0 , 1 , 1 ] ] if len ( buf ) == 0 : sol . append ( [ len ( root ) , 1 , 1 ] ) for child in root : sol . append ( [ len ( child [ 2 ] ) + 1 , child [ 0 ] + 1 , child [ 1 ] + 1 ] ) for gr_child in child [ 2 ] : sol . append ( [ len ( root ) + len ( gr_child [ 2 ] ) + 1 , gr_child [ 0 ] + 1 , gr_child [ 1 ] + 1 ] ) print ( ' % d \n % d ▁ % d ' % tuple ( max ( sol ) ) ) NEW_LINE


import java . util . * ; import java . io . * ; public class cf1239b {   public static void main ( String [ ] args ) throws IOException { BufferedReader bf = new BufferedReader ( new InputStreamReader ( System . in ) ) ; PrintWriter out = new PrintWriter ( new BufferedWriter ( new OutputStreamWriter ( System . out ) ) ) ;


import java . util . Scanner ;   public class A1368 { public static void main ( String [ ] args ) { Scanner scanner = new Scanner ( System . in ) ; int t = scanner . nextInt ( ) ; for ( int i = 0 ; i < t ; i ++ ) { int a = scanner . nextInt ( ) , c , k = 0 , b = scanner . nextInt ( ) , n = scanner . nextInt ( ) ; if ( a < b ) { c = a ; a = b ; b = c ; } do { if ( k % 2 == 0 ) { b += a ; c = b ; } else { a += b ; c = a ; } k ++ ; } while ( c <= n ) ; System . out . println ( k ) ; } } }

for _ in range ( int ( input ( ) ) ) : a , b , n = map ( int , input ( ) . split ( ) ) c = 0 while a <= n and b <= n : if a < b : a += b else : b += a c += 1 print ( c ) NEW_LINE


T = int ( input ( ) )   nums = [ ] final = [ ] counter = 0 for i in range ( T ) : counter = 0 nums = [ * map ( int , input ( ) . split ( " ▁ " ) ) ] while nums [ 0 ] <= nums [ 2 ] and nums [ 1 ] <= nums [ 2 ] : if nums [ 0 ] >= nums [ 1 ] : nums [ 1 ] += nums [ 0 ] else : nums [ 0 ] += nums [ 1 ] counter += 1 final . append ( counter )   for i in range ( len ( final ) ) : print ( final [ i ] ) NEW_LINE


for _ in range ( int ( input ( ) ) ) : a , b , n = [ int ( x ) for x in input ( ) . split ( ) ] i = 0 while a <= n and b <= n : if a < b : a += b else : b += a i += 1 print ( i ) NEW_LINE


t = int ( input ( ) )   for x in range ( t ) : a , b , n = map ( int , input ( ) . split ( ) )   if a > b : b , a = a , b   operation = 0 while a <= n and b <= n : a += b a , b = b , a operation += 1   print ( operation ) NEW_LINE


import java . io . BufferedReader ; import java . io . IOException ; import java . io . InputStreamReader ; import java . util . ArrayList ; import java . util . Collections ; import java . util . StringTokenizer ;   public class A { public static void main ( String [ ] args ) { FastScanner fs = new FastScanner ( ) ; int t = fs . nextInt ( ) ; while ( t -- > 0 ) { int a = fs . nextInt ( ) ; int b = fs . nextInt ( ) ; int n = fs . nextInt ( ) ;


import java . util . Scanner ; public class A { public static void main ( String [ ] args ) { Scanner scan = new Scanner ( System . in ) ; int t , a , b , n ; t = scan . nextInt ( ) ; while ( t -- > 0 ) { a = scan . nextInt ( ) ; b = scan . nextInt ( ) ; n = scan . nextInt ( ) ; int ctr = 0 ; while ( a <= n && b <= n ) { if ( a <= b ) a += b ; else b += a ; ++ ctr ; } System . out . println ( ctr ) ; } } }


import java . util . * ; import java . lang . String ; import java . lang . Math ; import java . util . Arrays ;   public class Capitalization2 { public static void main ( String [ ] args ) { Scanner sc = new Scanner ( System . in ) ; int t ; t = sc . nextInt ( ) ; for ( int i = 0 ; i < t ; i ++ ) { int a , b , n ; a = sc . nextInt ( ) ; b = sc . nextInt ( ) ; n = sc . nextInt ( ) ; int res = 0 ; while ( a <= n && b <= n ) { if ( a <= b ) a = a + b ; else b = b + a ; res ++ ; } System . out . println ( res ) ; } } }


import java . util . * ;   public class Runner { public static void main ( String [ ] args ) { Scanner sc = new Scanner ( System . in ) ; int tests = sc . nextInt ( ) ; for ( int i = 0 ; i < tests ; i ++ ) { int a = sc . nextInt ( ) ; int b = sc . nextInt ( ) ; int n = sc . nextInt ( ) ; int count = 0 ; while ( a <= n && b <= n ) { int smaller = getSmaller ( a , b ) ; if ( smaller == a ) { a += b ; } else { b += a ; } count ++ ; } System . out . println ( count ) ;   } } private static int getSmaller ( int a , int b ) { if ( a < b ) { return a ; } return b ; } private static int [ ] stringToIntArray ( String str ) { String [ ] strs = str . trim ( ) . split ( " ▁ " ) ; int [ ] intArr = new int [ strs . length ] ; for ( int i = 0 ; i < strs . length ; i ++ ) { intArr [ i ] = Integer . parseInt ( strs [ i ] ) ; } return intArr ; }   }


import java . util . * ; import java . io . * ;   public class Main { private static final int N = ( int ) 1e6 + 10 ; public static void main ( String [ ] args ) throws IOException { int t , n , k ; int [ ] a = new int [ N ] ; StreamTokenizer cin = new StreamTokenizer ( new BufferedReader ( new InputStreamReader ( System . in ) ) ) ; cin . nextToken ( ) ; t = ( int ) cin . nval ; while ( t -- > 0 ) { cin . nextToken ( ) ; n = ( int ) cin . nval ; int i ; for ( i = 1 ; i <= n ; i ++ ) { int x ; cin . nextToken ( ) ; x = ( int ) cin . nval ; if ( i % 2 == 1 ) System . out . print ( Math . abs ( x ) + " ▁ " ) ; else System . out . print ( - Math . abs ( x ) + " ▁ " ) ; } System . out . println ( ) ; }   }   }

for _ in range ( int ( input ( ) ) ) : n = int ( input ( ) ) a = list ( map ( int , input ( ) . split ( ) ) ) for i in range ( len ( a ) ) : if i % 2 == 0 : print ( abs ( a [ i ] ) , end = ' ▁ ' ) else : print ( - abs ( a [ i ] ) , end = ' ▁ ' ) print ( ) NEW_LINE


for _ in range ( int ( input ( ) ) ) : n = int ( input ( ) ) arr = [ abs ( int ( x ) ) for x in input ( ) . split ( ) ] out = [ ] for i in range ( len ( arr ) ) : if i % 2 == 0 : out . append ( arr [ i ] ) else : out . append ( arr [ i ] * - 1 ) print ( * out ) NEW_LINE


import sys , mathsys . setrecursionlimit ( 10 ** 8 ) ''' def ▁ fun ( ) : ▁ ▁ ▁ ▁ for ▁ i ▁ in ▁ range ( 16 ) : ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ for ▁ j ▁ in ▁ range ( 4 ) : ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ if ▁ i & (1 < < j ) : ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ print ( j , end = ' ' ) ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ print ( ) import ▁ binarytreefrom ▁ collections ▁ import ▁ dequebst ▁ = ▁ binarytree . tree ( height = 4 , is _ perfect = True ) print ( bst ) def ▁ s ( bst ) : ▁ ▁ ▁ ▁ if ▁ bst : ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ bst . left , bst . right ▁ = ▁ bst . right , bst . left ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ s ( bst . right ) ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ s ( bst . left ) s ( bst ) print ( bst ) ''' t = int ( input ( ) ) for _ in range ( t ) : n = int ( input ( ) ) a = list ( map ( int , input ( ) . split ( ) ) ) for i in range ( 0 , n ) : if i % 2 == 1 : if a [ i ] < 0 : a [ i ] = 0 - a [ i ] else : if a [ i ] > 0 : a [ i ] = 0 - a [ i ] print ( ' ▁ ' . join ( map ( str , a ) ) )   NEW_LINE


import sys   def answer ( n , a ) : b = [ ] for i in range ( n ) : if i % 2 == 0 : b . append ( abs ( a [ i ] ) ) else : b . append ( - abs ( a [ i ] ) )   return b NEW_LINE


import sysimport mathfrom math import factorial , inf , gcdfrom heapq import * from functools import * from itertools import * from collections import * from typing import * sys . setrecursionlimit ( 10 ** 5 ) NEW_LINE


import java . util . * ; public class Main { public static void main ( String [ ] args ) { Scanner scan = new Scanner ( System . in ) ; int t = scan . nextInt ( ) ; while ( t > 0 ) { int n = scan . nextInt ( ) ; t -- ; int a [ ] = new int [ n ] ; for ( int i = 0 ; i < n ; i ++ ) { a [ i ] = scan . nextInt ( ) ; } int c = - 1 ; for ( int i = 0 ; i < n ; i ++ ) { if ( a [ i ] < 0 ) { a [ i ] *= - 1 ; } } for ( int i = 0 ; i < n ; i ++ ) { a [ i ] = a [ i ] * c ; c *= - 1 ; } for ( int i = 0 ; i < n ; i ++ ) { System . out . print ( a [ i ] + " ▁ " ) ; } System . out . println ( ) ;   } } }


import java . util . * ; import java . io . * ; public class Main2 { 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 int mod = ( int ) ( 1e9 + 7 ) ; static FastReader sc = new FastReader ( ) ; static PrintWriter out = new PrintWriter ( System . out ) ; public static void main ( String [ ] args ) { int z = 1 ; z = sc . nextInt ( ) ; while ( z -- > 0 ) { int n = sc . nextInt ( ) ; int x = sc . nextInt ( ) ; int m = sc . nextInt ( ) ; int l = x , h = x ; long ans = 1 ; while ( m -- > 0 ) { int u = sc . nextInt ( ) ; int v = sc . nextInt ( ) ; if ( u <= l && v >= l ) { l = Math . min ( u , l ) ; h = Math . max ( v , h ) ; } if ( u <= h && v >= h ) { l = Math . min ( u , l ) ; h = Math . max ( v , h ) ; } }

t = int ( input ( ) )   for _ in range ( t ) : n , posof1 , m = list ( map ( int , input ( ) . split ( " ▁ " ) ) ) res = 0 begin = posof1 end = posof1 for x in range ( m ) :   temp = list ( map ( int , input ( ) . split ( " ▁ " ) ) ) if temp [ 0 ] <= begin <= temp [ 1 ] or temp [ 0 ] <= end <= temp [ 1 ] : begin = min ( begin , temp [ 0 ] ) end = max ( end , temp [ 1 ] )   print ( end - begin + 1 )       NEW_LINE


tt = int ( input ( ) ) for i in range ( 0 , tt ) : n , x , m = map ( int , input ( ) . split ( ) ) l , r = x , x for x in range ( m ) : L , R = map ( int , input ( ) . split ( ) ) if max ( l , L ) <= min ( r , R ) : l = min ( l , L ) r = max ( r , R ) print ( r - l + 1 ) NEW_LINE


import sys   input = sys . stdin . readline   for i in range ( int ( input ( ) ) ) :     n , x , m = map ( int , input ( ) . split ( ) )           a = x b = x for j in range ( m ) : l , r = map ( int , input ( ) . split ( ) )       if l <= a <= r or l <= b <= r : a = min ( a , l ) b = max ( b , r ) print ( b - a + 1 ) NEW_LINE


import sys   def answer ( n , x , m , l , r ) : lptr = x rptr = x for i in range ( m ) : if l [ i ] < lptr and r [ i ] >= lptr : lptr = l [ i ] if r [ i ] > rptr and l [ i ] <= rptr : rptr = r [ i ] k = ( rptr - lptr ) + 1 return k   def main ( ) : t = int ( input ( ) ) while t : n , x , m = [ int ( i ) for i in sys . stdin . readline ( ) . split ( ) ] l = [ 0 ] * m r = [ 0 ] * m for j in range ( m ) : l [ j ] , r [ j ] = [ int ( i ) for i in sys . stdin . readline ( ) . split ( ) ] print ( answer ( n , x , m , l , r ) ) t -= 1 returnmain ( ) NEW_LINE


import java . io . BufferedReader ; import java . io . IOException ; import java . io . InputStreamReader ; import java . io . PrintWriter ; import java . util . * ;    public class Solution { public static void main ( String [ ] args ) { FastScanner sc = new FastScanner ( ) ; int t = sc . nextInt ( ) ; while ( t -- > 0 ) { int INF = ( int ) 1e9 ; int n = sc . nextInt ( ) , x = sc . nextInt ( ) , m = sc . nextInt ( ) , mini = x , maxi = x ; while ( m -- > 0 ) { int l = sc . nextInt ( ) , r = sc . nextInt ( ) ; if ( ( l <= maxi ) && ( r >= mini ) ) { maxi = Math . max ( maxi , r ) ; mini = Math . min ( mini , l ) ; } } System . out . println ( maxi - mini + 1 ) ; } } 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 [ ] readArray ( int n ) { Long [ ] a = new Long [ n ] ; for ( int i = 0 ; i < n ; i ++ ) a [ i ] = nextLong ( ) ; return a ; } long nextLong ( ) { return Long . parseLong ( next ( ) ) ; } } }


import java . io . * ; import java . util . * ; import java . io . BufferedReader ; import java . io . IOException ; import java . io . InputStreamReader ;    public class Main1 {      public static void main ( String [ ] args ) {   try {    FastScanner in = new FastScanner ( ) ; PrintWriter out = new PrintWriter ( System . out ) ;    int t = in . nextInt ( ) ; while ( t -- > 0 ) { long n = in . nextLong ( ) ; long x = in . nextLong ( ) ; long m = in . nextLong ( ) ; long max = - 1 ; long min = Long . MAX_VALUE ;   boolean flag = false ;


import java . util . * ; import java . io . * ;   public class CFA { BufferedReader br ; PrintWriter out ; StringTokenizer st ; boolean eof ; private static final long MOD = 1000L * 1000L * 1000L + 7 ; private static final int [ ] dx = { 0 , - 1 , 0 , 1 } ; private static final int [ ] dy = { 1 , 0 , - 1 , 0 } ; private static final String yes = " Yes " ; private static final String no = " No " ;   void solve ( ) {

import math     class CodeforcesTask1147BSolution : def __init__ ( self ) : self . result = ' ' self . n_m = [ ] self . points = [ ]   def read_input ( self ) : self . n_m = [ int ( x ) for x in input ( ) . split ( " ▁ " ) ] for x in range ( self . n_m [ 1 ] ) : self . points . append ( [ int ( y ) for y in input ( ) . split ( " ▁ " ) ] )   def process_task ( self ) : can = False segm = { } for point in self . points : segm [ " { 0 } _ {1 } " . format ( * point ) ] = True segm [ " { 1 } _ {0 } " . format ( * point ) ] = True for k in range ( 1 , self . n_m [ 0 ] ) : if not self . n_m [ 0 ] % k : NEW_LINE


def check ( k , g ) : for i in g : a = ( i [ 0 ] + k ) % n b = ( i [ 1 ] + k ) % n if not ( min ( a , b ) , max ( a , b ) ) in g : return False return True   n , m = [ int ( i ) for i in input ( ) . split ( ) ]   g = set ( ) for i in range ( m ) : a , b = [ int ( i ) for i in input ( ) . split ( ) ] a -= 1 b -= 1 NEW_LINE


import java . util . HashMap ; import java . util . HashSet ; import java . util . Scanner ;   public class ChladniFigure { static class Pair { int a ; int b ; int done = 0 ; public Pair ( int a0 , int b0 ) { a = Math . min ( a0 , b0 ) ; b = Math . max ( a0 , b0 ) ; } public String toString ( ) { return ( " ( " + a + " ▁ " + b + " ) " ) ; } } static int n , m ; static HashMap < Integer , HashSet < Integer > > map = new HashMap < > ( ) ; static HashSet < Pair > set = new HashSet < > ( ) ; static HashMap < Integer , HashMap < Integer , Pair > > maptoobj = new HashMap < > ( ) ; static void addpair ( int a , int b ) { if ( a > b ) { int temp = a ; a = b ; b = temp ; } if ( ! map . containsKey ( a ) ) { map . put ( a , new HashSet < Integer > ( ) ) ; maptoobj . put ( a , new HashMap < > ( ) ) ; } map . get ( a ) . add ( b ) ; Pair pair = new Pair ( a , b ) ; set . add ( pair ) ; maptoobj . get ( a ) . put ( b , pair ) ; } static boolean checkpair ( int a , int b ) { if ( a > b ) { int temp = a ; a = b ; b = temp ; } return ( map . containsKey ( a ) && map . get ( a ) . contains ( b ) ) ; }   public static void main ( String [ ] args ) { Scanner sc = new Scanner ( System . in ) ; n = sc . nextInt ( ) ; int startn = n ;


import java . io . * ; import java . lang . reflect . Array ; import java . math . * ; import java . util . * ;   public class icpc { public static void main ( String [ ] args ) throws IOException { Reader in = new Reader ( ) ;


import java . util . * ; import java . io . * ; public class Main { public static void main ( String args [ ] ) { new Main ( ) . work ( ) ; } Scanner in = new Scanner ( System . in ) ; PrintWriter out = new PrintWriter ( System . out ) ; void work ( ) { int n = in . nextInt ( ) , m = in . nextInt ( ) ; ArrayList < Integer > [ ] graph = ( ArrayList < Integer > [ ] ) new ArrayList [ n ] ; for ( int i = 0 ; i < n ; i ++ ) graph [ i ] = new ArrayList < Integer > ( ) ; for ( int i = 0 ; i < m ; i ++ ) { int c1 = in . nextInt ( ) - 1 ; int c2 = in . nextInt ( ) - 1 ; if ( c1 < c2 ) { graph [ c1 ] . add ( c2 ) ; graph [ c2 ] . add ( c1 + n ) ; } else { graph [ c2 ] . add ( c1 ) ; graph [ c1 ] . add ( c2 + n ) ; } } for ( int i = 0 ; i < n ; i ++ ) Collections . sort ( graph [ i ] ) ; boolean f = false ; out : for ( int i = 1 ; i < n ; i ++ ) { if ( n % i != 0 ) continue ; for ( int j = 0 ; j < n ; j ++ ) { int k = ( j + i ) % n ; if ( graph [ j ] . size ( ) != graph [ k ] . size ( ) ) continue out ; for ( int l = 0 ; l < graph [ j ] . size ( ) ; l ++ ) { if ( ( graph [ j ] . get ( l ) + i ) % n != graph [ k ] . get ( l ) % n ) { continue out ; } } } f = true ; break ; } if ( f ) { out . print ( " Yes " ) ; } else { out . print ( " No " ) ; } out . flush ( ) ; } }


import java . util . * ; import java . io . * ;   public class Main { public static void main ( String [ ] args ) throws IOException { FastScanner in = new FastScanner ( System . in ) ; PrintWriter out = new PrintWriter ( System . out ) ; new Main ( ) . run ( in , out ) ; out . close ( ) ; }   public static long mod = 17352642619633L ;   void run ( FastScanner in , PrintWriter out ) {


import java . io . IOException ; import java . util . * ; public class Punctuation {   public static void main ( String [ ] args ) throws IOException {

s = str ( input ( ) ) l = ' , . ! ? ' e = ' ' for i in range ( 0 , len ( s ) ) : if ( s [ i ] not in l and s [ i ] != ' ▁ ' ) : e = e + s [ i ] elif ( s [ i ] == ' ▁ ' ) : if ( e [ - 1 ] == ' ▁ ' ) : pass else : e = e + s [ i ] else : if ( e [ - 1 ] == ' ▁ ' ) : e = e [ 0 : len ( e ) - 1 ] e = e + s [ i ] + ' ▁ ' else : e = e + s [ i ] + ' ▁ ' print ( e ) NEW_LINE


a = input ( ) z = len ( a ) d = [ ] ; t = " " for i in a : if i . isalpha ( ) : t += i else : if t != " " : d . append ( t ) if i in ' . , ? ! ' : d . append ( i ) t = " " d . append ( t ) p = len ( d ) for i in range ( p - 1 ) : if d [ i + 1 ] in " . , ? ! " : print ( d [ i ] , end = " " ) else : print ( d [ i ] , end = " ▁ " ) print ( d [ - 1 ] ) NEW_LINE


punc = [ ' . ' , ' , ' , ' ! ' , ' ? ' ] ;   s = input ( ) x = s . split ( ) res = str ( ) ;   for i in x : res = res + i + ' ▁ '   for c in punc : y = res . split ( c ) NEW_LINE


import re s = input ( ) . strip ( ) s = re . sub ( ' \s + ' , ' ▁ ' , s ) s = re . sub ( ' \s ? ( [ . , ! ? ] ) \s ? ' , ' \\1 ▁ ' , s ) print ( s ) NEW_LINE


import res = re . sub ( " \ ▁ + " , " ▁ " , input ( ) ) s = re . sub ( ' ▁ * ( [ , . ! ? ] ) ▁ * ' , r ' \1 ▁ ' , s ) print ( s ) NEW_LINE


import java . util . * ; public class j { public static void main ( String [ ] args ) { Scanner sc = new Scanner ( System . in ) ; String S = sc . nextLine ( ) ; StringBuilder sd = new StringBuilder ( " " ) ; for ( int i = 0 ; i < S . length ( ) ; i ++ ) { if ( S . charAt ( i ) >= ' a ' && S . charAt ( i ) <= ' z ' ) sd . append ( S . charAt ( i ) ) ; else if ( S . charAt ( i ) == ' ▁ ' ) { for ( ; S . charAt ( i ) == ' ▁ ' ; i ++ ) { } if ( S . charAt ( i ) >= ' a ' && S . charAt ( i ) <= ' z ' ) { sd . append ( ' ▁ ' ) ; sd . append ( S . charAt ( i ) ) ; } else { sd . append ( S . charAt ( i ) ) ; if ( S . charAt ( i + 1 ) != ' ▁ ' ) sd . append ( ' ▁ ' ) ; } } else if ( S . charAt ( i ) == ' . ' || S . charAt ( i ) == ' , ' || S . charAt ( i ) == ' ! ' || S . charAt ( i ) == ' ? ' ) { sd . append ( S . charAt ( i ) ) ; if ( S . charAt ( i + 1 ) != ' ▁ ' ) sd . append ( ' ▁ ' ) ; } } System . out . println ( sd ) ; }   }


import java . util . * ; import java . io . * ; public class Main { public static void main ( String [ ] args ) throws Exception { Scanner sc = new Scanner ( System . in ) ; PrintWriter pw = new PrintWriter ( System . out ) ; String text = sc . nextLine ( ) ; int n = text . length ( ) ; StringBuilder str = new StringBuilder ( text ) ; int i = 0 , j = 0 ; for ( i = 0 ; i < str . length ( ) ; i ++ ) { if ( str . charAt ( i ) == ' ▁ ' ) { j = i + 1 ; while ( j < str . length ( ) && str . charAt ( j ) == ' ▁ ' ) { str . deleteCharAt ( j ) ; } } } for ( i = 0 ; i < str . length ( ) ; i ++ ) { if ( str . charAt ( i ) == ' . ' || str . charAt ( i ) == ' , ' || str . charAt ( i ) == ' ! ' || str . charAt ( i ) == ' ? ' ) { if ( str . charAt ( i - 1 ) == ' ▁ ' ) { str . deleteCharAt ( i - 1 ) ; i -= 1 ; } if ( str . charAt ( i + 1 ) != ' ▁ ' ) { str . insert ( i + 1 , ' ▁ ' ) ; } } } if ( str . charAt ( str . length ( ) - 1 ) == ' ▁ ' ) str . deleteCharAt ( str . length ( ) - 1 ) ; pw . print ( str . toString ( ) ) ;  		      pw . close ( ) ; }


import java . io . BufferedReader ; import java . io . IOException ; import java . io . InputStreamReader ; import java . io . PrintWriter ; import java . math . BigInteger ; import java . util . HashMap ; import java . util . Scanner ; import java . util . StringTokenizer ;   public class Main {   public static void main ( String [ ] args ) {   Scanner sc = new Scanner ( System . in ) ; int t = sc . nextInt ( ) ; HashMap < Integer , Integer > map = new HashMap < Integer , Integer > ( ) ; int num = 0 ; while ( t -- > 0 ) { int a = sc . nextInt ( ) ; num = Math . max ( a , num ) ; if ( map . containsKey ( a ) ) { map . put ( a , map . get ( a ) + 1 ) ; } else { map . put ( a , 1 ) ; } } for ( int i = 1 ; i <= num ; i ++ ) { if ( num % i == 0 ) { map . put ( i , map . get ( i ) - 1 ) ; } } int ans = 0 ; for ( int i = num ; i >= 1 ; i -- ) { if ( map . containsKey ( i ) ) { if ( map . get ( i ) != 0 ) { ans = i ; break ; } } } System . out . println ( num + " ▁ " + ans ) ; } }

n = int ( input ( ) ) s = list ( map ( int , input ( ) . split ( ) ) ) b = max ( s ) for i in range ( 1 , b + 1 ) : if ( b % i == 0 ) : s . pop ( s . index ( i ) ) a = max ( s ) print ( a , b ) NEW_LINE


n = int ( input ( ) ) divisors = [ int ( bruh ) for bruh in input ( ) . split ( ) ] divvies = sorted ( divisors ) bignum = divvies [ 0 ] * divvies [ - 1 ]   bignumdivvies = [ ]   for div in range ( 1 , bignum + 1 ) : if bignum % div == 0 : bignumdivvies . append ( div )   bignumdivvies = list ( set ( bignumdivvies ) )   smallnumdivvies = [ ]   for x in sorted ( divisors ) : for y in range ( divisors . count ( x ) - bignumdivvies . count ( x ) ) : smallnumdivvies . append ( x )   smallnum = smallnumdivvies [ 0 ] * smallnumdivvies [ - 1 ]   print ( bignum , smallnum ) NEW_LINE


import sys , mathsys . setrecursionlimit ( 10 ** 8 ) ''' def ▁ fun ( ) : ▁ ▁ ▁ ▁ for ▁ i ▁ in ▁ range ( 16 ) : ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ for ▁ j ▁ in ▁ range ( 4 ) : ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ if ▁ i & (1 < < j ) : ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ print ( j , end = ' ' ) ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ print ( ) import ▁ binarytreefrom ▁ collections ▁ import ▁ dequebst ▁ = ▁ binarytree . tree ( height = 4 , is _ perfect = True ) print ( bst ) def ▁ s ( bst ) : ▁ ▁ ▁ ▁ if ▁ bst : ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ bst . left , bst . right ▁ = ▁ bst . right , bst . left ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ s ( bst . right ) ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ s ( bst . left ) s ( bst ) print ( bst ) ''' t = int ( input ( ) ) a = list ( map ( int , input ( ) . split ( ) ) ) m = max ( a ) a [ a . index ( 1 ) ] = - 1 a [ a . index ( m ) ] = - 1 for i in range ( 2 , int ( m ** 0.5 ) + 1 ) : if m % i == 0 : a [ a . index ( i ) ] = - 1 if m // i != i : a [ a . index ( m // i ) ] = - 1 a . append ( 1 ) print ( m , max ( a ) ) NEW_LINE


import sys   def answer ( n , d ) : NEW_LINE


n = int ( input ( ) ) arr = list ( map ( int , input ( ) . split ( ) ) ) x = max ( arr ) divs = [ ] for z in range ( 1 , x + 1 ) : if x % z == 0 : arr . pop ( arr . index ( z ) )   print ( x , max ( arr ) ) 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 {   public static void main ( String [ ] args ) {


import java . util . Arrays ; import java . util . Scanner ;   public class Main { public static void main ( String [ ] args ) { Scanner in = new Scanner ( System . in ) ; int n = in . nextInt ( ) ; int [ ] a = new int [ n ] ; int [ ] b = new int [ n ] ; int [ ] c = new int [ n ] ; int topb = - 1 , topc = - 1 ; for ( int i = 0 ; i < n ; i ++ ) { a [ i ] = in . nextInt ( ) ; }


import java . io . * ; import java . util . * ; import java . lang . * ; public class Main { static InputReader sc ; static PrintWriter pw ; public static void main ( String [ ] args ) { InputStream inputStream = System . in ; OutputStream outputStream = System . out ; sc = new InputReader ( inputStream ) ; pw = new PrintWriter ( outputStream ) ; solve ( ) ; pw . close ( ) ; }

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 ( ) arr = lmp ( ) mn = min ( arr ) d = n // mnif d == 0 : print ( - 1 ) else : rem = n % mn for i in range ( d ) : rem += mn for j in range ( 8 , - 1 , - 1 ) : if arr [ j ] <= rem : break print ( j + 1 , end = ' ' ) rem -= arr [ j ] NEW_LINE


v = int ( input ( ) ) a = list ( map ( int , input ( ) . split ( ) ) )   mincost = min ( a ) dig = v // mincost   if dig == 0 : print ( - 1 ) exit ( )   for i in range ( dig , 0 , - 1 ) : for j in range ( 9 , 0 , - 1 ) : if v - a [ j - 1 ] >= mincost * ( i - 1 ) : print ( j , end = " " ) v -= a [ j - 1 ] breakprint ( ) NEW_LINE


def colour_the_fence ( ) : n = int ( input ( ) ) litre_list = list ( map ( int , str ( input ( ) ) . split ( ) ) ) paint_dict = { }   for i in range ( 1 , 10 ) : if litre_list [ i - 1 ] > n : continue paint_dict [ litre_list [ i - 1 ] ] = i NEW_LINE


from sys import stdin , stdoutnmbr = lambda : int ( stdin . readline ( ) ) lst = lambda : list ( map ( int , input ( ) . split ( ) ) ) for i in range ( 1 ) : NEW_LINE


import java . io . OutputStream ; import java . io . IOException ; import java . io . InputStream ; import java . io . OutputStream ; import java . io . PrintWriter ; import java . io . BufferedWriter ; import java . io . Writer ; import java . io . OutputStreamWriter ; import java . util . InputMismatchException ; import java . io . IOException ; import java . util . ArrayList ; import java . io . InputStream ;   public class Main { public static void main ( String [ ] args ) { InputStream inputStream = System . in ; OutputStream outputStream = System . out ; InputReader in = new InputReader ( inputStream ) ; OutputWriter out = new OutputWriter ( outputStream ) ; BColorTheFence solver = new BColorTheFence ( ) ; solver . solve ( 1 , in , out ) ; out . close ( ) ; }   static class BColorTheFence { public void solve ( int testNumber , InputReader in , OutputWriter out ) {   int v = in . nextInt ( ) ; int [ ] costs = new int [ 10 ] ; int mini = Integer . MAX_VALUE ;   for ( int i = 1 ; i <= 9 ; i ++ ) { costs [ i ] = in . nextInt ( ) ; mini = Math . min ( mini , costs [ i ] ) ; }   int d = v / mini ; if ( d == 0 ) { out . print ( " - 1" ) ; return ; }   int idx = - 1 ; for ( int i = 1 ; i <= 9 ; i ++ ) { if ( costs [ i ] == mini ) idx = i ; }   ArrayList < Integer > ans = new ArrayList < > ( ) ; for ( int i = 0 ; i < d ; i ++ ) { ans . add ( idx ) ; }   int left = v - ( mini * d ) ;   for ( int i = 0 ; i < d ; i ++ ) { for ( int j = 9 ; j >= 1 ; j -- ) { if ( left + mini >= costs [ j ] ) { ans . set ( i , j ) ; left -= costs [ j ] ; left += mini ; break ; } } }   for ( int el : ans ) out . print ( el ) ;


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

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 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 ( ) ; } } }


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

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 . 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 ;


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 " ) ; } }

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 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 " ) ; } }


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 ) ; } }

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 . 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 ) ; }   }


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 ) + " ▁ " ) ; } } }

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 . 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 + " ▁ " ) ; } } }


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 " ) ; } }

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 . * ; 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 " ) ; } }


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 ( ) ;

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 . 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 ] )


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

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 . 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 ) ; } }


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 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 . 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 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 ( ) ;

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 . * ; 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 ;


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

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