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 ) ; TaskB solver = new TaskB ( ) ; solver . solve ( 1 , in , out ) ; out . close ( ) ; }   static class TaskB { public void solve ( int testNumber , InputReader in , PrintWriter out ) { int K = in . nextInt ( ) ; int b = K + 2000 ; int [ ] res = new int [ 2000 ] ; res [ 0 ] = - 1 ; for ( int i = 1 ; i < 2000 ; i ++ ) { if ( b == 0 ) { break ; } else { if ( b > 1000000 ) { b -= 1000000 ; res [ i ] = 1000000 ; } else { res [ i ] = b ; b = 0 ; } } } out . println ( 2000 ) ; for ( int val : res ) { out . print ( val + " ▁ " ) ; } }   }   static class InputReader { public BufferedReader reader ; public StringTokenizer tokenizer ;   public InputReader ( InputStream stream ) { reader = new BufferedReader ( new InputStreamReader ( stream ) , 32768 ) ; tokenizer = null ; }   public String next ( ) { while ( tokenizer == null || ! tokenizer . hasMoreTokens ( ) ) { try { tokenizer = new StringTokenizer ( reader . readLine ( ) ) ; } catch ( IOException e ) { throw new RuntimeException ( e ) ; } } return tokenizer . nextToken ( ) ; }   public int nextInt ( ) { return Integer . parseInt ( next ( ) ) ; }   } }


def solve ( Z ) : if Z <= 1000000 - 10 : return [ - 1 , Z + 2 ] for l in range ( 2000 ) : m = l + 1 if m < 4 or m > 2000 : continue Y = ( Z + 1 ) // ( m - 1 ) + 1 c = Y * ( m - 1 ) - ( Z + 1 ) X = Y + c + 1 if X >= 1000000 or Y + 2 >= 1000000 : continue if Y >= m / 2 - 1 : ans = [ X , - ( X + 1 ) ] for _ in range ( m - 4 ) : ans . append ( 0 ) ans . append ( - 1 ) ans . append ( Y + 2 )           return ans return - 1   Z = int ( input ( ) ) ans = solve ( Z ) print ( len ( ans ) ) print ( ' ▁ ' . join ( [ str ( x ) for x in ans ] ) ) NEW_LINE


k = int ( input ( ) ) ans = [ - 1 ] while sum ( ans ) - len ( ans ) + 1 != k : ans . append ( min ( 10 ** 6 , k + len ( ans ) - sum ( ans ) ) ) print ( len ( ans ) ) print ( * ans ) 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 . Random ; import java . util . StringTokenizer ; import java . util . stream . IntStream ;   public class Solution { 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 k = fs . nextInt ( ) ; int a = k + 1 ; out . println ( 1002 ) ; out . print ( " - 1 ▁ " ) ; for ( int i = 0 ; i < 1001 ; i ++ ) { int ans = 1 ; ans += Math . min ( ( int ) 1e6 - 1 , a ) ; a -= Math . min ( ( int ) 1e6 - 1 , a ) ; out . print ( ans + " ▁ " ) ; } out . println ( ) ; } out . close ( ) ; } static final Random random = new Random ( ) ; static < T > void shuffle ( T [ ] arr ) { int n = arr . length ; for ( int i = 0 ; i < n ; i ++ ) { int k = random . nextInt ( n ) ; T temp = arr [ k ] ; arr [ k ] = arr [ i ] ; arr [ i ] = temp ; } } static void ruffleSort ( int [ ] a ) { int n = a . length ;

n = int ( input ( ) ) ans = [ - 1 ] n += 1 while n > 0 : n += 1 add = min ( n , 1000000 ) ans . append ( add ) n -= addprint ( len ( ans ) ) for i in ans : print ( i , end = " ▁ " ) print ( ) NEW_LINE


import java . io . * ; import java . util . * ;   public class A { private BufferedReader reader ; private StreamTokenizer tokenizer ;

d = { } m , k = map ( int , input ( ) . split ( ) ) for i in range ( m ) : a , b = map ( int , input ( ) . split ( ) ) d . setdefault ( a , set ( ) ) . add ( b ) d . setdefault ( b , set ( ) ) . add ( a ) for x in sorted ( d ) : s = [ ] for y in sorted ( d ) : if x == y or y in d [ x ] : continue if len ( d [ x ] & d [ y ] ) * 100 >= k * len ( d [ x ] ) : s += [ str ( y ) ] print ( str ( x ) + ' : ' , len ( s ) , ' ▁ ' . join ( s ) ) NEW_LINE


f = lambda : map ( int , input ( ) . split ( ) ) g = lambda x , y : d . setdefault ( x , set ( ) ) . add ( y ) d = { } m , k = f ( ) for i in range ( m ) : a , b = f ( ) g ( a , b ) g ( b , a ) t = sorted ( d ) for a in t : s = [ str ( b ) for b in t if a != b and b not in d [ a ] and len ( d [ a ] & d [ b ] ) * 100 >= k * len ( d [ a ] ) ] print ( str ( a ) + ' : ' , len ( s ) , ' ▁ ' . join ( s ) ) NEW_LINE


f = lambda : map ( int , input ( ) . split ( ) ) g = lambda x , y : d . setdefault ( x , set ( ) ) . add ( y ) h = lambda b : a == b or b in d [ a ] or len ( d [ a ] & d [ b ] ) * 100 < k * len ( d [ a ] ) d = { } m , k = f ( ) for i in range ( m ) : a , b = f ( ) g ( a , b ) g ( b , a ) t = sorted ( d ) for a in t : s = [ str ( b ) for b in t if not h ( b ) ] print ( str ( a ) + ' : ' , len ( s ) , ' ▁ ' . join ( s ) ) NEW_LINE


import java . io . * ; import java . lang . reflect . Array ; import java . util . * ;   public class Main {   public static int gcd ( int a , int b ) { while ( b != 0 ) { int tmp = a % b ; a = b ; b = tmp ; } return a ; }   public static void main ( String [ ] args ) throws IOException { FastScanner in = new FastScanner ( System . in ) ; FastPrinter out = new FastPrinter ( System . out ) ;


import java . util . Scanner ; public class Main {   public static void main ( String [ ] args ) { Scanner keyBoard = new Scanner ( System . in ) ; String regeX = keyBoard . nextLine ( ) ; String [ ] separados = regeX . split ( " ▁ " ) ;   int n1 = Integer . parseInt ( separados [ 0 ] ) ; int n2 = Integer . parseInt ( separados [ 1 ] ) ; int k1 = Integer . parseInt ( separados [ 2 ] ) ; int k2 = Integer . parseInt ( separados [ 3 ] ) ;   if ( n1 > n2 ) { System . out . println ( " First " ) ; } else { System . out . println ( " Second " ) ; }   } }

def str_list ( s , char ) : output_list = [ ] collector = " " for i in range ( len ( s ) ) : if s [ i ] == char : if collector : output_list . append ( int ( collector ) ) collector = " " else : collector += s [ i ] output_list . append ( int ( collector ) ) return output_list     def list_str ( l , char ) : output_str = " " for i in range ( len ( l ) - 1 ) : output_str += str ( l [ i ] ) + char output_str += str ( l [ len ( l ) - 1 ] ) return output_str     def main_function ( ) : n_1 , n_2 , k_1 , k_2 = str_list ( input ( ) , " ▁ " ) ratio_1 = n_1 // k_1 ratio_2 = n_2 // k_2 if n_1 > n_2 : return " First " else : return " Second "     print ( main_function ( ) )   NEW_LINE


a = list ( map ( int , input ( ) . split ( " ▁ " ) ) ) if ( a [ 0 ] > a [ 1 ] ) : print ( " First " ) else : print ( " Second " ) NEW_LINE


n1 , n2 , k1 , k2 = map ( int , input ( ) . split ( ) ) flag1 = 0 flag2 = 0 i = 1 while True : if i % 2 != 0 : if n1 < 1 : flag1 = 1 break else : n1 -= 1 if n1 < 1 : flag1 = 1 break else : if n2 < 1 : flag2 = 1 break else : n2 -= 1 if n2 < 1 : flag2 = 1 break i += 1 if flag1 == 1 : print ( " Second " ) else : print ( " First " ) NEW_LINE


if __name__ == " _ _ main _ _ " : n1 , n2 , k1 , k2 = list ( map ( int , input ( ) . split ( ) ) ) if n2 >= n1 : print ( ' Second ' ) else : print ( ' First ' ) NEW_LINE


n1 , n2 , k1 , k2 = map ( int , input ( ) . split ( ) )   if n1 > n2 : print ( " First " ) else : print ( " Second " ) NEW_LINE


import java . util . * ; import static java . lang . Math . cbrt ;   public class Test { public static void main ( String [ ] args ) throws Exception {   Scanner input = new Scanner ( System . in ) ; int n1 = input . nextInt ( ) ; int n2 = input . nextInt ( ) ; int k1 = input . nextInt ( ) ; int k2 = input . nextInt ( ) ;   System . out . println ( n1 > n2 ? " First " : " Second " ) ; } }


import java . util . Scanner ;   public class Main { public static void main ( String [ ] args ) { int jugador1 , jugador2 , lanzamientos1 , lanzamientos2 ; Scanner teclado = new Scanner ( System . in ) ; jugador1 = teclado . nextInt ( ) ; jugador2 = teclado . nextInt ( ) ; if ( jugador1 > jugador2 ) { System . out . println ( " First " ) ; } else { System . out . println ( " Second " ) ; } }   }


import java . util . Scanner ; public class Main { public static void main ( String [ ] args ) { Scanner keyBoard = new Scanner ( System . in ) ; String regeX = keyBoard . nextLine ( ) ; String [ ] separados = regeX . split ( " ▁ " ) ; int n1 = Integer . parseInt ( separados [ 0 ] ) ; int n2 = Integer . parseInt ( separados [ 1 ] ) ; int k1 = Integer . parseInt ( separados [ 2 ] ) ; int k2 = Integer . parseInt ( separados [ 3 ] ) ; if ( n1 > n2 ) { System . out . println ( " First " ) ; } else { System . out . println ( " Second " ) ; } } }


import java . io . * ; import java . util . ArrayDeque ; import java . util . Arrays ; import java . util . StringTokenizer ;   public class Polygons {   public static void main ( String [ ] args ) throws IOException {   FastReader reader = new FastReader ( ) ; FastWriter writer = new FastWriter ( ) ; int n = reader . readSingleInt ( ) ;   int [ ] [ ] points = new int [ n ] [ 2 ] ; for ( int i = 0 ; i < n ; i ++ ) { points [ i ] = reader . readIntArray ( 2 ) ; }   int [ ] [ ] [ ] convexHullHalves = getConvexHull ( points ) ;

def convex_hull ( points ) : points = sorted ( set ( points ) )   if len ( points ) <= 1 : return points   def cross ( o , a , b ) : return ( a [ 0 ] - o [ 0 ] ) * ( b [ 1 ] - o [ 1 ] ) - ( a [ 1 ] - o [ 1 ] ) * ( b [ 0 ] - o [ 0 ] )   lower = [ ] for p in points : while len ( lower ) >= 2 and cross ( lower [ - 2 ] , lower [ - 1 ] , p ) < 0 : lower . pop ( ) lower . append ( p )   upper = [ ] for p in reversed ( points ) : while len ( upper ) >= 2 and cross ( upper [ - 2 ] , upper [ - 1 ] , p ) < 0 : upper . pop ( ) upper . append ( p )   return lower [ : - 1 ] + upper [ : - 1 ]     def d ( ) : total = [ ]   n = int ( input ( ) ) a , b = [ ] , [ ] for i in range ( n ) : x , y = map ( int , input ( ) . split ( ) ) total . append ( ( x , y ) ) a . append ( ( x , y ) )   m = int ( input ( ) )   for j in range ( m ) : x , y = map ( int , input ( ) . split ( ) ) total . append ( ( x , y ) ) b . append ( ( x , y ) ) set_a = set ( ) for i in a : set_a . add ( i ) for j in b : if ( j in set_a ) : print ( " NO " ) return     if ( sorted ( a ) == sorted ( convex_hull ( total ) ) ) : print ( " YES " ) else : print ( " NO " )   d ( ) NEW_LINE


from functools import reducedef convex_hull_graham ( points ) : TURN_LEFT , TURN_RIGHT , TURN_NONE = ( 1 , - 1 , 0 ) def cmp ( a , b ) : return ( a > b ) - ( a < b )   def turn ( p , q , r ) : return cmp ( ( q [ 0 ] - p [ 0 ] ) * ( r [ 1 ] - p [ 1 ] ) - ( r [ 0 ] - p [ 0 ] ) * ( q [ 1 ] - p [ 1 ] ) , 0 )   def _keep_left ( hull , r ) : while len ( hull ) > 1 and turn ( hull [ - 2 ] , hull [ - 1 ] , r ) not in { TURN_LEFT , TURN_NONE } : NEW_LINE


from math import * from collections import defaultdict as ddfrom sys import stdin , stdout , setrecursionlimit as srlfrom bisect import bisect_right as br , bisect_left as blfrom heapq import heapify , heappush as hpush , heappop as hpopsrl ( 10 ** 6 + 999 ) ; mod = int ( 1e9 ) + 7 ; yes = ' YES ' ; no = ' NO ' ; class graph : def __init__ ( self , n ) : self . d = dd ( list ) self . vis = [ 0 ] * ( n + 1 ) self . dp = [ [ 0 , 0 ] for i in range ( n + 1 ) ] def addvrtx ( self , src , dest ) : self . d [ src ] . append ( dest ) self . d [ dest ] . append ( src ) def value ( a , b , c ) : return a [ 0 ] * ( b [ 1 ] - c [ 1 ] ) + b [ 0 ] * ( c [ 1 ] - a [ 1 ] ) + c [ 0 ] * ( a [ 1 ] - b [ 1 ] ) def cw ( a , b , c ) : return value ( a , b , c ) > 0 def acw ( a , b , c ) : return value ( a , b , c ) < 0 def collinear ( a , b , c ) : return value ( a , b , c ) == 0 def ConvexHull ( p , n ) : if ( n <= 2 ) : return p . sort ( ) p1 = p [ 0 ] NEW_LINE


import java . math . BigDecimal ; import java . math . BigInteger ; import java . util . * ;   public class Main { static final int N = 110 ; static int n , m ; static long sum = 0 ; static long [ ] [ ] [ ] d = new long [ N ] [ N ] [ N ] ; static long [ ] cnt = new long [ N ] ; static int [ ] a = new int [ N ] ; static BigInteger [ ] big = new BigInteger [ N ] ; public static void main ( String [ ] args ) { Scanner reader = new Scanner ( System . in ) ; n = reader . nextInt ( ) ; for ( int i = 1 ; i <= n ; ++ i ) { a [ i ] = reader . nextInt ( ) ; sum += a [ i ] ; } m = reader . nextInt ( ) ; if ( sum <= m ) { System . out . println ( n ) ; return ; } for ( int i = 1 ; i <= n ; ++ i ) d [ i ] [ 0 ] [ 0 ] = 1 ; for ( int o = 1 ; o <= n ; ++ o ) { for ( int i = 1 ; i <= n ; ++ i ) { if ( i == o ) continue ; for ( int j = i - 1 ; j >= 0 ; -- j ) for ( int k = m ; k >= 0 ; -- k ) { if ( k + a [ i ] > m ) cnt [ j + 1 ] += d [ o ] [ k ] [ j ] ; else d [ o ] [ k + a [ i ] ] [ j + 1 ] += d [ o ] [ k ] [ j ] ; } } }

n = int ( input ( ) ) arr = list ( map ( int , input ( ) . split ( ) ) ) p = int ( input ( ) ) dp = [ [ [ 0 for k in range ( n + 1 ) ] for i in range ( p + 1 ) ] for i in range ( n + 1 ) ] for j in range ( p + 1 ) : for k in range ( n + 1 ) : dp [ 0 ] [ j ] [ k ] = 1 for i in range ( 1 , n + 1 ) : for j in range ( p + 1 ) : for k in range ( 1 , n + 1 ) : if j >= arr [ k - 1 ] : dp [ i ] [ j ] [ k ] = dp [ i ] [ j ] [ k - 1 ] + i * dp [ i - 1 ] [ j - arr [ k - 1 ] ] [ k - 1 ] else : dp [ i ] [ j ] [ k ] = dp [ i ] [ j ] [ k - 1 ] fact = nans = 0 for i in range ( 1 , n + 1 ) : ans += dp [ i ] [ p ] [ n ] / fact fact *= ( n - i ) print ( ans ) NEW_LINE


import math   n = int ( input ( ) ) a = [ int ( x ) for x in input ( ) . split ( ) ] p = int ( input ( ) )   sum = 0 ; for x in range ( n ) : sum += a [ x ] if ( sum <= p ) : print ( n ) else : ans = 0 for i in range ( n ) : dp = [ [ [ 0 for z in range ( 55 ) ] for y in range ( 55 ) ] for x in range ( 55 ) ] dp [ - 1 ] [ 0 ] [ 0 ] = 1 for j in range ( n ) : if ( j == i ) :   for k in range ( n ) : for z in range ( p + 1 ) : dp [ j ] [ k ] [ z ] = dp [ j - 1 ] [ k ] [ z ] continue   for k in range ( n ) :   for z in range ( p + 1 ) :   if ( z + a [ j ] <= p ) : dp [ j ] [ k + 1 ] [ z + a [ j ] ] += dp [ j - 1 ] [ k ] [ z ] dp [ j ] [ k ] [ z ] += dp [ j - 1 ] [ k ] [ z ]     for k in range ( n ) : for z in range ( p + 1 ) : if ( z + a [ i ] > p ) : ans += k * dp [ n - 1 ] [ k ] [ z ] * math . factorial ( k ) * math . factorial ( n - k - 1 )   print ( ans / math . factorial ( n ) ) NEW_LINE


n = input ( ) n = int ( n ) arr = [ 0 ] * nfact = [ 0 ] * 51 a = input ( ) . split ( ) p = input ( ) p = int ( p )   for i in range ( n ) : arr [ i ] = int ( a [ i ] )   if n == 1 : if arr [ 0 ] <= p : print ( 1 ) else : print ( 0 ) exit ( 0 )   def pre ( ) : fact [ 0 ] = 1 for i in range ( 1 , 51 ) : fact [ i ] = fact [ i - 1 ] * i   def get ( arr , min_sum , max_sum ) : ways = [ [ 0 for i in range ( max_sum + 1 ) ] for i in range ( len ( arr ) + 1 ) ] ways [ 0 ] [ 0 ] = 1 for i in range ( len ( arr ) ) : for j in range ( i , - 1 , - 1 ) : for k in range ( max_sum , - 1 , - 1 ) : if k + arr [ i ] <= max_sum : ways [ j + 1 ] [ k + arr [ i ] ] += ways [ j ] [ k ]   ans = 0 counted = 0 for i in range ( 0 , len ( arr ) + 1 ) : for j in range ( min_sum , max_sum + 1 ) : ans += fact [ i ] * fact [ n - i - 1 ] * ways [ i ] [ j ] * i counted += fact [ i ] * fact [ n - i - 1 ] * ways [ i ] [ j ]   return ans , counted   pre ( ) tot = 0 count = 0 sm = 0 for i in range ( n ) : sm += arr [ i ] arr1 = [ 0 ] * ( n - 1 ) got = 0 for j in range ( n ) : if j == i : continue arr1 [ got ] = arr [ j ] got += 1 how_many = get ( arr1 , max ( 0 , p - arr [ i ] + 1 ) , p ) tot += how_many [ 0 ] count += how_many [ 1 ]   def get_div ( a , b ) : NEW_LINE


from pprint import pprint   n = int ( input ( ) ) a = list ( map ( int , input ( ) . split ( ) ) ) p = int ( input ( ) )   fact = [ 1 ]   for i in range ( 1 , 51 ) : fact . append ( fact [ - 1 ] * i )   if sum ( a ) <= p : print ( n ) else :   dp = [ [ 0 ] * 56 for _ in range ( 56 ) ] dp [ 0 ] [ 0 ] = 1 for i in range ( n ) : for j in range ( n , - 1 , - 1 ) : for k in range ( p ) : if a [ i ] + k <= p : dp [ a [ i ] + k ] [ j + 1 ] += dp [ k ] [ j ]   tot = sum ( dp [ j ] [ i ] * fact [ i ] * fact [ n - i ] for i in range ( 1 , n + 1 ) for j in range ( 1 , p + 1 ) )   print ( f ' { tot / fact [ n ] : . 9f } ' ) NEW_LINE


n = int ( input ( ) ) a = list ( map ( int , input ( ) . split ( ) ) ) p = int ( input ( ) )   fact = [ 1 ]   for i in range ( 1 , 51 ) : fact . append ( fact [ - 1 ] * i )   if sum ( a ) <= p : print ( n ) else :   dp = [ [ 0 ] * 56 for _ in range ( 56 ) ] dp [ 0 ] [ 0 ] = 1 for i in range ( n ) : for j in range ( n , - 1 , - 1 ) : for k in range ( p ) : if a [ i ] + k <= p : dp [ j + 1 ] [ a [ i ] + k ] += dp [ j ] [ k ]   tot = sum ( dp [ i ] [ j ] * fact [ i ] * fact [ n - i ] for j in range ( 1 , p + 1 ) for i in range ( 1 , n + 1 ) )   print ( f ' { tot / fact [ n ] : . 9f } ' ) NEW_LINE


import java . io . BufferedReader ; import java . io . IOException ; import java . io . InputStreamReader ; import java . io . PrintWriter ; import java . util . Arrays ; import java . util . Random ; import java . util . StringTokenizer ;   public class Solution { static final int max = 55 ; 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 sum = 0 ; int [ ] a = new int [ n ] ; for ( int i = 0 ; i < n ; i ++ ) { a [ i ] = fs . nextInt ( ) ; sum += a [ i ] ; } int p = fs . nextInt ( ) ; if ( sum <= p ) { out . println ( n ) ; out . flush ( ) ; return ; } double [ ] fact = new double [ max ] ; fact [ 0 ] = 1 ; for ( int i = 1 ; i < max ; i ++ ) fact [ i ] = fact [ i - 1 ] * i ;


import java . io . BufferedReader ; import java . io . InputStreamReader ; import java . io . IOException ; import java . util . StringTokenizer ; import java . util . Arrays ; public class Solution { public static void main ( String [ ] args ) { try ( BufferedReader in = new BufferedReader ( new InputStreamReader ( System . in ) ) ) { char [ ] word = in . readLine ( ) . toCharArray ( ) ; boolean flag = false ;

from collections import defaultdictimport sysimport mathdef input ( ) : return sys . stdin . readline ( ) . strip ( ) def iinput ( ) : return int ( input ( ) ) def minput ( ) : return map ( int , input ( ) . split ( ) ) def listinput ( ) : return list ( map ( int , input ( ) . split ( ) ) ) """ ▁ a = input ( ) b = input ( ) c = input ( ) a + = bif ▁ len ( a ) ! = len ( c ) : ▁ ▁ ▁ ▁ print ( " NO " ) else : ▁ ▁ ▁ ▁ orig , check = { } , { } ▁ ▁ ▁ ▁ for ▁ i ▁ in ▁ range ( len ( a ) ) : ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ orig [ a [ i ] ] = orig . get ( a [ i ] ,0 ) + 1 ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ check [ c [ i ] ] = check . get ( c [ i ] ,0 ) + 1 ▁ ▁ ▁ ▁ k = list ( set ( map ( str , a ) ) ) ▁ ▁ ▁ ▁ answer = " YES " ▁ ▁ ▁ ▁ for ▁ i ▁ in ▁ k : ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ if ▁ orig . get ( i , 0 ) ! = check . get ( i , 0 ) : ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ answer = " NO " ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ break ▁ ▁ ▁ ▁ print ( answer ) ▁ """ """ ▁ l = listinput ( ) l . insert ( 0,999 ) for ▁ i ▁ in ▁ range ( 1 , len ( l ) ) : ▁ ▁ ▁ ▁ d = { } ▁ ▁ ▁ ▁ while ▁ True : ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ d [ i ] = d . get ( i , 0 ) + 1 ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ i = l [ i ] ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ if ▁ d . get ( i , 0 ) = = 2 : ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ print ( i , end = ' ▁ ' ) ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ break ▁ """ """ ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ n = iinput ( ) answer = 0for ▁ i ▁ in ▁ range ( n / /1234567 + 1 ) : ▁ ▁ ▁ ▁ for ▁ j ▁ in ▁ range ( ( n - i * 1234567 ) / /123456 + 1 ) : ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ if ▁ ( n - i * 1234567 - j * 123456 ) % 1234 = = 0 : ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ answer = 1 ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ break ▁ ▁ ▁ ▁ if ▁ answer : ▁ ▁ ▁ ▁ ▁ ▁ ▁ ▁ breakif ▁ answer : ▁ ▁ ▁ ▁ print ( " YES " ) else : ▁ ▁ ▁ ▁ print ( " NO " ) ▁ """ s = list ( map ( str , input ( ) ) ) i = 0 while i < len ( s ) and s [ i ] == ' a ' : i += 1 if i == len ( s ) : print ( ' ' . join ( s ) [ : - 1 ] + ' z ' ) else : while i < len ( s ) and s [ i ] != ' a ' : s [ i ] = chr ( ord ( s [ i ] ) - 1 ) i += 1 print ( ' ' . join ( s ) ) NEW_LINE


s = input ( ) if len ( set ( s ) ) == 1 and s [ 0 ] == ' a ' : print ( s [ : - 1 ] + ' z ' ) exit ( ) j = 0 for i in range ( len ( s ) ) : if s [ i ] == ' a ' and j != 0 : print ( s [ i : ] ) break else : if s [ i ] == ' a ' : print ( s [ i ] , end = ' ' ) else : j += 1 print ( chr ( ord ( s [ i ] ) - 1 ) , end = ' ' ) print ( ) NEW_LINE


import java . io . BufferedReader ; import java . io . InputStreamReader ; import java . io . IOException ; import java . util . StringTokenizer ; import java . util . Arrays ; public class Solution { public static void main ( String [ ] args ) { try ( BufferedReader in = new BufferedReader ( new InputStreamReader ( System . in ) ) ) { char [ ] word = in . readLine ( ) . toCharArray ( ) ; boolean flag = false ; for ( int i = 0 ; i < word . length ; i ++ ) { if ( word [ i ] != ' a ' ) { word [ i ] = ( char ) ( word [ i ] - 1 ) ; flag = true ; } else if ( flag ) { break ; } } if ( ! flag ) word [ word . length - 1 ] = ' z ' ; System . out . println ( word ) ; } catch ( IOException e ) { } } }


import java . io . BufferedReader ; import java . io . IOException ; import java . io . InputStreamReader ;   public class test { public static void main ( String ... args ) throws NumberFormatException , IOException { BufferedReader br = new BufferedReader ( new InputStreamReader ( System . in ) ) ; String s = br . readLine ( ) ; char [ ] a = s . toCharArray ( ) ; int i = 0 ; int n = s . length ( ) ; while ( i < n && a [ i ] == ' a ' ) { i ++ ; } if ( i == n ) { a [ n - 1 ] = ' z ' ; } else { while ( i < n && a [ i ] != ' a ' ) { a [ i ] = ( char ) ( a [ i ] - 1 ) ; i ++ ; } } System . out . println ( new String ( a ) ) ; } }


import java . io . BufferedReader ; import java . io . IOException ; import java . io . InputStreamReader ;   public class LettersShift { public static void main ( String [ ] args ) throws IOException { BufferedReader r = new BufferedReader ( new InputStreamReader ( System . in ) ) ; String s = r . readLine ( ) ; char [ ] o = s . toCharArray ( ) ; int j = 0 ; for ( ; j < o . length - 1 ; j ++ ) if ( o [ j ] > n ( o [ j ] ) ) break ; for ( int i = j ; i < o . length ; i ++ ) if ( i != j && o [ i ] < n ( o [ i ] ) ) break ; else o [ i ] = n ( o [ i ] ) ; System . out . println ( new String ( o ) ) ; }   public static char n ( char c ) { return c == ' a ' ? ' z ' : ( char ) ( c - 1 ) ; } }


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

""" ▁ Created ▁ by ▁ Henrikh ▁ Kantuni ▁ on ▁ 3/15/17 ▁ """   if __name__ == " _ _ main _ _ " : n = int ( input ( ) ) min_r1 = 2 * 10 ** 9 max_l1 = 0   while n > 0 : l1 , r1 = [ int ( x ) for x in input ( ) . split ( ) ] if r1 < min_r1 : min_r1 = r1 if l1 > max_l1 : max_l1 = l1 n -= 1   m = int ( input ( ) ) min_r2 = 2 * 10 ** 9 max_l2 = 0   while m > 0 : l2 , r2 = [ int ( x ) for x in input ( ) . split ( ) ] if r2 < min_r2 : min_r2 = r2 if l2 > max_l2 : max_l2 = l2 m -= 1   if max_l2 - min_r1 >= 0 and max_l1 - min_r2 >= 0 : print ( max ( max_l2 - min_r1 , max_l1 - min_r2 ) ) elif max_l2 - min_r1 >= 0 : print ( max_l2 - min_r1 ) elif max_l1 - min_r2 >= 0 : print ( max_l1 - min_r2 ) else : print ( 0 ) NEW_LINE


a , b , c , d = [ ] , [ ] , [ ] , [ ] n = int ( input ( ) ) for _ in range ( n ) : l1 , r1 = map ( int , input ( ) . split ( ) ) a . append ( r1 ) c . append ( l1 ) m = int ( input ( ) ) for _ in range ( m ) : l2 , r2 = map ( int , input ( ) . split ( ) ) b . append ( l2 ) d . append ( r2 ) if min ( a ) >= max ( b ) and min ( d ) >= max ( c ) : print ( 0 ) else : print ( max ( max ( b ) - min ( a ) , max ( c ) - min ( d ) ) ) NEW_LINE


n = int ( input ( ) ) mn1 = 100000000000000 mx2 = 1 for i in range ( n ) : l , r = map ( int , input ( ) . split ( ) ) if r < mn1 : mn1 = r if l > mx2 : mx2 = l m = int ( input ( ) ) mx1 = 1 mn2 = 10000000000000000 for i in range ( m ) : l , r = map ( int , input ( ) . split ( ) ) if l > mx1 : mx1 = l if r < mn2 : mn2 = r if mx1 - mn1 <= 0 and mx2 - mn2 <= 0 : print ( 0 ) else : print ( max ( mx1 - mn1 , mx2 - mn2 ) ) NEW_LINE


n = int ( input ( ) ) maxln = 0 minrn = 10 ** 9 + 1 for i in range ( n ) : l , r = map ( int , input ( ) . split ( ) ) maxln = max ( l , maxln ) minrn = min ( r , minrn ) m = int ( input ( ) ) ans = - 1 for i in range ( m ) : l , r = map ( int , input ( ) . split ( ) ) if l > minrn : ans = max ( ans , l - minrn ) if r < maxln : ans = max ( ans , maxln - r ) ans = max ( 0 , ans ) print ( ans ) NEW_LINE


n = int ( input ( ) ) a = 1e10 b = 0 for _ in range ( n ) : x , y = map ( int , input ( ) . split ( ) ) if ( y < a ) : a = int ( y ) if ( x > b ) : b = x   m = int ( input ( ) ) c = 1e10 d = 0 for _ in range ( m ) : x , y = map ( int , input ( ) . split ( ) ) if ( y < c ) : c = int ( y ) if ( x > d ) : d = x NEW_LINE


import java . lang . * ; import java . util . * ; import java . util . stream . Collectors ; import java . io . * ;   public class pblm3 { static class Pair { int i ; int j ; public Pair ( int x , int y ) { this . i = x ; this . j = y ; } } public static void main ( String [ ] args ) { Scanner sc = new Scanner ( System . in ) ; int n = sc . nextInt ( ) ; Pair [ ] ar = new Pair [ n ] ; for ( int i = 0 ; i < n ; i ++ ) { ar [ i ] = new Pair ( sc . nextInt ( ) , sc . nextInt ( ) ) ; } int m = sc . nextInt ( ) ; Pair [ ] br = new Pair [ m ] ; for ( int i = 0 ; i < m ; i ++ ) { br [ i ] = new Pair ( sc . nextInt ( ) , sc . nextInt ( ) ) ; } Arrays . sort ( ar , ( a , b ) -> { if ( a . i == b . i ) return a . j - b . j ; else return a . i - b . i ; } ) ; Arrays . sort ( br , ( a , b ) -> { if ( a . i == b . i ) return a . j - b . j ; else return a . i - b . i ; } ) ; int diff = 0 ;


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


import java . util . * ;   public class CF102 { public static void main ( String [ ] args ) { Scanner sc = new Scanner ( System . in ) ; int q = sc . nextInt ( ) ; for ( int i = 0 ; i < q ; i ++ ) { int n = sc . nextInt ( ) ; List < Integer > list = new ArrayList < > ( ) ;   for ( int j = 0 ; j < n ; j ++ ) { list . add ( sc . nextInt ( ) ) ; } int index_1 = list . indexOf ( 1 ) ; boolean checkcase1 = true ; for ( int j = 0 ; j <= index_1 ; j ++ ) { if ( list . get ( j ) != ( index_1 + 1 - j ) ) { checkcase1 = false ; break ; } } int num = n ; for ( int j = index_1 + 1 ; j < n ; j ++ ) { if ( list . get ( j ) != num ) { checkcase1 = false ; break ; } else { num -= 1 ; } } boolean checkcase2 = true ; int num1 = 1 ; for ( int j = index_1 ; j < n ; j ++ ) { if ( list . get ( j ) != num1 ) { checkcase2 = false ; break ; } else { num1 += 1 ; } }

t = int ( input ( ) ) res = [ ] for i in range ( t ) : n = int ( input ( ) ) a = list ( map ( int , input ( ) . split ( ) ) ) s = a . index ( 1 ) f = 1 nxt = ( s + 1 ) % n if ( a [ nxt ] - a [ s ] == 1 ) : nxt = ( s + 1 ) % n while ( a [ nxt ] != 1 ) : if ( a [ nxt ] - a [ s ] == 1 ) : s = ( s + 1 ) % n else : res . append ( " NO " ) f = 0 break nxt = ( s + 1 ) % n else : nxt = s - 1 if ( nxt < 0 ) : nxt = n - 1 while ( a [ nxt ] != 1 ) : if ( a [ nxt ] - a [ s ] == 1 ) : s -= 1 if ( s < 0 ) : s = n - 1 else : res . append ( " NO " ) f = 0 break nxt = s - 1 if ( nxt < 0 ) : nxt = n - 1 if ( f == 1 ) : res . append ( " YES " ) for i in res : print ( i ) NEW_LINE


from sys import stdin , stdoutfrom collections import Counter NEW_LINE


for _ in range ( int ( input ( ) ) ) : n = int ( input ( ) ) l = list ( map ( int , input ( ) . split ( ) ) ) l1 = sorted ( l ) i = l . index ( 1 ) lr = l [ i + 1 : ] if len ( lr ) != n : ll = l [ : i ] else : ll = [ ] if [ 1 ] + lr + ll == l1 : print ( " YES " ) elif [ 1 ] + ll [ : : - 1 ] + lr [ : : - 1 ] == l1 : print ( " YES " ) else : print ( " NO " ) NEW_LINE


def solve ( ) : n = int ( input ( ) ) p = list ( map ( int , input ( ) . split ( ) ) ) is_clockwise , is_counterclockwise = True , True idx_first = p . index ( 1 ) for i in range ( n ) : if p [ ( idx_first + i ) % n ] != i + 1 : is_clockwise = False break idx_last = p . index ( n ) for i in range ( n ) : if p [ ( idx_last + i ) % n ] != n - i : is_counterclockwise = False break if is_clockwise or is_counterclockwise : print ( ' YES ' ) else : print ( ' NO ' )   q = int ( input ( ) ) for _ in range ( q ) : solve ( ) NEW_LINE


q = int ( input ( ) )   for bruh in range ( q ) : n = int ( input ( ) ) students = list ( map ( int , input ( ) . split ( ) ) )   i = students . index ( 1 )   new_order = students [ i + 1 : ] + students [ : i ]   if new_order == sorted ( new_order ) or new_order == sorted ( new_order , reverse = True ) : print ( " YES " ) else : print ( " NO " ) NEW_LINE


import java . util . Scanner ;   public class CircleStudents { public static void main ( String [ ] args ) { Scanner sc = new Scanner ( System . in ) ; int t = sc . nextInt ( ) ; while ( t -- > 0 ) { int n = sc . nextInt ( ) ; int a [ ] = new int [ n ] ; for ( int i = 0 ; i < n ; i ++ ) { a [ i ] = sc . nextInt ( ) ; } int k = 0 ; while ( k < n - 1 && ( Math . abs ( a [ k ] - a [ k + 1 ] ) == 1 || Math . abs ( a [ k ] - a [ k + 1 ] ) == n - 1 ) ) { ++ k ; } if ( k == n - 1 ) { System . out . println ( " YES " ) ; } else { System . out . println ( " NO " ) ; } } } }


import java . util . * ; import java . lang . * ; import java . util . * ; public class Main { public static void main ( String [ ] args ) { Scanner sc = new Scanner ( System . in ) ; int t = sc . nextInt ( ) ; for ( int p = 0 ; p < t ; p ++ ) { int n = sc . nextInt ( ) ; String ans = " " ; int prev = - 1 ; boolean c = true ; boolean d = true ; for ( int i = 0 ; i < n ; i ++ ) { int a = sc . nextInt ( ) ; if ( prev != - 1 ) { if ( c && a % n != ( prev + 1 ) % n ) { c = false ;   } if ( d && a % n != ( n + prev - 1 ) % n ) { d = false ; } } prev = a ; } if ( c || d ) ans = " YES " ; else ans = " NO " ; System . out . println ( ans ) ; } } }


import java . util . * ; public class Main { public static void main ( String [ ] args ) { Scanner sc = new Scanner ( System . in ) ; int t = sc . nextInt ( ) ;   for ( int i = 0 ; i < t ; i ++ ) { int n = sc . nextInt ( ) ; int pos = - 1 ; boolean lrot = true ; boolean rrot = true ; int [ ] arr = new int [ n ] ;   for ( int j = 0 ; j < n ; j ++ ) { arr [ j ] = sc . nextInt ( ) ;   if ( arr [ j ] == 1 ) { pos = j ; } }   for ( int j = 1 ; j < n ; j ++ ) { lrot &= ( arr [ ( pos - j + n ) % n ] == j + 1 ) ; rrot &= ( arr [ ( pos + j + n ) % n ] == j + 1 ) ; }   if ( lrot || rrot ) System . out . println ( " YES " ) ; else System . out . println ( " NO " ) ; } } }


import java . util . * ;    public class Practise {


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

n = input ( ) m = input ( ) l1 = len ( n ) l2 = len ( m ) if l1 != l2 : print ( ' NO ' ) else : for i in range ( l1 ) : if n [ i ] != m [ l2 - 1 - i ] : print ( ' NO ' ) break else : print ( " YES " ) NEW_LINE


s1 = input ( ) [ : : - 1 ] s2 = input ( ) if s1 == s2 : print ( ' YES ' ) else : print ( ' NO ' ) NEW_LINE


t = str ( input ( ) ) s = str ( input ( ) ) z = 0 if len ( t ) == len ( s ) : for i in range ( 0 , len ( t ) ) : if t [ i ] == s [ len ( t ) - 1 - i ] : z += 1 if z == len ( t ) : print ( " YES " ) else : print ( " NO " ) NEW_LINE


s = input ( ) t = input ( ) t = t [ : : - 1 ] if ( s == t ) : print ( " YES " ) else : print ( " NO " ) NEW_LINE


str1 = input ( ) str2 = input ( )   new_s = str2 [ : : - 1 ]   if str1 == new_s : print ( " YES " ) else : print ( " NO " ) NEW_LINE


import java . io . BufferedReader ; import java . io . IOException ; import java . io . InputStreamReader ; import java . util . StringTokenizer ;   public class A_Translation { public static void main ( String [ ] args ) { FastScanner fs = new FastScanner ( ) ; String s = fs . next ( ) , t = fs . next ( ) ;   System . out . println ( ( s . equals ( new StringBuilder ( t ) . reverse ( ) . toString ( ) ) ) ? " YES " : " NO " ) ; }   static int min ( int a , int b ) { return Math . min ( a , b ) ; }   static int max ( int a , int b ) { return Math . max ( a , b ) ; }   static long min ( long a , long b ) { return Math . min ( a , b ) ; }   static long max ( long a , long b ) { return Math . max ( a , b ) ; }   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 ( ) ) ; } char nextChar ( ) { return next ( ) . charAt ( 0 ) ; }   String nextLine ( ) { String str = " " ; try { str = br . readLine ( ) ; } catch ( IOException e ) { e . printStackTrace ( ) ; } return str ; } } }


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 ; FastScanner in = new FastScanner ( inputStream ) ; PrintWriter out = new PrintWriter ( outputStream ) ; ATranslation solver = new ATranslation ( ) ; solver . solve ( 1 , in , out ) ; out . close ( ) ; }   static class ATranslation { public void solve ( int testNumber , FastScanner fs , PrintWriter out ) { String s = fs . next ( ) , t = fs . next ( ) ; if ( s . equals ( new StringBuilder ( t ) . reverse ( ) . toString ( ) ) ) { out . println ( " YES " ) ; } else { out . println ( " NO " ) ; } }   }   static class FastScanner { BufferedReader br ; StringTokenizer st ;   public FastScanner ( InputStream inputStream ) { br = new BufferedReader ( new InputStreamReader ( inputStream ) ) ; }   public String next ( ) { while ( st == null || ! st . hasMoreElements ( ) ) { try { st = new StringTokenizer ( br . readLine ( ) ) ; } catch ( IOException e ) { e . printStackTrace ( ) ; } } return st . nextToken ( ) ; }   } }


import java . io . * ; import java . math . * ; import java . security . * ; import java . text . * ; import java . util . * ; import java . util . concurrent . * ; import java . util . function . * ; import java . util . regex . * ; import java . util . stream . * ; import static java . util . stream . Collectors . joining ; import static java . util . stream . Collectors . toList ;   public class Solution {   public static void main ( String args [ ] ) { Scanner scan = new Scanner ( System . in ) ; String b1 = scan . next ( ) ; String b2 = scan . next ( ) ; int n = b1 . length ( ) ; int m = b2 . length ( ) ; if ( n != m ) System . out . print ( " NO " ) ; else { int b = 0 , e = n - 1 ; while ( b < n && e >= 0 ) { if ( b1 . charAt ( b ) != b2 . charAt ( e ) ) { System . out . println ( " NO " ) ; break ; } b ++ ; e -- ; } if ( b == n && e < 0 ) System . out . print ( " YES " ) ; } } }


import java . util . ArrayList ; import java . util . Scanner ; import java . math . * ;   public class CompProg {   public static void main ( String [ ] args ) { Scanner scan = new Scanner ( System . in ) ; String word1 = scan . next ( ) ; String word2 = scan . next ( ) ; boolean match = true ; if ( word1 . length ( ) != word2 . length ( ) ) match = false ; if ( match ) { for ( int i = 0 ; i < word1 . length ( ) ; i ++ ) { if ( word1 . charAt ( i ) != word2 . charAt ( word2 . length ( ) - 1 - i ) ) match = false ; } } if ( match ) System . out . println ( " YES " ) ; else System . out . println ( " NO " ) ; }   }


import java . util . * ; import java . io . * ;   public class Main254B { static int cal ( int month , int day ) { int [ ] months = { 0 , 31 , 28 , 31 , 30 , 31 , 30 , 31 , 31 , 30 , 31 , 30 , 31 } ; int res = 0 ; for ( int i = 1 ; i <= month - 1 ; i ++ ) res += months [ i ] ; return res + day ; } public static void main ( String [ ] args ) throws IOException { File in = new File ( " input . txt " ) ; Writer wr = new FileWriter ( " output . txt " ) ; Scanner sc = new Scanner ( in ) ; int n = sc . nextInt ( ) ; int [ ] marked = new int [ 2 * 365 + 1 ] ; for ( int i = 0 ; i < n ; i ++ ) { int m = sc . nextInt ( ) ; int d = sc . nextInt ( ) ; int p = sc . nextInt ( ) ; int t = sc . nextInt ( ) ; int x = cal ( m , d ) ; for ( int j = 1 ; j <= t ; j ++ ) { marked [ x - j + 365 ] += p ; } } int ans = 0 ; for ( int i = 0 ; i < marked . length ; i ++ ) { ans = Math . max ( marked [ i ] , ans ) ; } wr . write ( ans + " ▁ " ) ; wr . flush ( ) ; wr . close ( ) ; } }


def day ( m , d ) : days = 0 for i in range ( 1 , m ) : if i in [ 1 , 3 , 5 , 7 , 8 , 10 , 12 ] : days += 31 elif i == 2 : days += 28 else : days += 30 days += d + 100 return daysstdin = open ( ' input . txt ' , ' r ' ) f = open ( " output . txt " , ' w ' ) days = [ 0 ] * 565 n = int ( stdin . readline ( ) . strip ( ) ) for _ in range ( n ) : print ( " sdfds " ) m , d , p , t = map ( int , stdin . readline ( ) . split ( ) ) day_num = day ( m , d ) NEW_LINE


from datetime import date , timedeltaimport math     w = open ( ' output . txt ' , ' w ' ) r = open ( ' input . txt ' , ' r ' ) oplympiads = [ ]   min_date = date ( 2014 , 1 , 1 ) max_date = date ( 2011 , 1 , 1 )   n = int ( r . readline ( ) )   for _ in range ( n ) : m , d , p , t = map ( int , r . readline ( ) . split ( ) ) oplympiads . append ( ( m , d , p , t ) ) if ( date ( 2013 , m , d ) > max_date ) : max_date = date ( 2013 , m , d ) if ( date ( 2013 , m , d ) - timedelta ( t ) < min_date ) : min_date = date ( 2013 , m , d ) - timedelta ( t ) days_needed = ( max_date - min_date ) . daysnumber_of_workers_in_day = [ 0 ] * days_neededfor m , d , p , t in oplympiads : for dte in range ( t ) : number_of_workers_in_day [ ( ( date ( 2013 , m , d ) - timedelta ( t - dte ) ) - min_date ) . days ] += pw . write ( ' { } ' . format ( max ( number_of_workers_in_day ) ) ) NEW_LINE


import syssys . stdin = open ( ' input . txt ' , ' r ' ) sys . stdout = open ( ' output . txt ' , ' w ' )   di = { } k = 1 days = [ 31 , 28 , 31 , 30 , 31 , 30 , 31 , 31 , 30 , 31 , 30 , 31 ]   for i in range ( 12 ) : for j in range ( days [ i ] ) : di [ ( i + 1 , j + 1 ) ] = k k += 1   n = int ( input ( ) ) a = [ 0 ] * 512 for _ in range ( n ) : m , d , p , t = map ( int , input ( ) . split ( ) ) temp = di [ ( m , d ) ] for x in range ( temp - t , temp ) : a [ x ] += p   print ( max ( a ) ) NEW_LINE


import java . io . BufferedReader ; import java . io . File ; import java . io . InputStreamReader ; import java . io . PrintWriter ; import java . util . * ; import java . util . concurrent . ConcurrentMap ;   public class Watermelon { static int [ ] month = { 0 , 31 , 28 , 31 , 30 , 31 , 30 , 31 , 31 , 30 , 31 , 30 , 31 } ; public static void main ( String [ ] args ) throws java . lang . Exception { Scanner sc = new Scanner ( new File ( " input . txt " ) ) ; PrintWriter pw = new PrintWriter ( " output . txt " ) ;


import java . io . BufferedReader ; import java . io . File ; import java . io . FileNotFoundException ; import java . io . FileReader ; import java . io . IOException ; import java . io . InputStreamReader ; import java . io . PrintWriter ; import java . time . LocalDate ; import java . util . HashMap ; import java . util . Map ; import java . util . StringTokenizer ;    public class Main {   public static void main ( String [ ] args ) throws IOException {   FastReader in = new FastReader ( new File ( " input . txt " ) ) ; PrintWriter out = new PrintWriter ( new File ( " output . txt " ) ) ;


import java . util . Scanner ; public class AA {   public static void main ( String [ ] args ) { int i , k = 0 , j = 0 , max = 0 ; Scanner obj = new Scanner ( System . in ) ;   int N = obj . nextInt ( ) ; int [ ] Liste = new int [ N ] ; for ( i = 0 ; i < N ; i ++ ) { Liste [ i ] = obj . nextInt ( ) ; if ( Liste [ i ] >= k ) { k = Liste [ i ] ; j ++ ; if ( max < j ) { max = j ; } } else { j = 1 ; k = Liste [ i ] ; } } System . out . println ( max ) ;   }   }

i = inputi ( ) c = m = l = 0 for n in i ( ) . split ( ) : n = int ( n ) c = c + 1 if n >= l else 1 m = max ( m , c ) l = nprint ( m ) NEW_LINE


n = int ( input ( ) ) subs = list ( map ( int , input ( ) . split ( ) ) ) memo = [ 0 , 1 ] + [ 0 ] * ( n - 1 ) max_subs = 1   for i in range ( 2 , n + 1 ) : current = subs [ i - 1 ] if current >= subs [ i - 2 ] : memo [ i ] = memo [ i - 1 ] + 1 max_subs = memo [ i ] if memo [ i ] > max_subs else max_subs else : if memo [ i - 1 ] > max_subs : max_subs = memo [ i - 1 ] memo [ i ] = 1 print ( max_subs ) NEW_LINE


def solve ( arr , n ) : max_val = 0 count = 1 for i in range ( n - 1 ) : if arr [ i + 1 ] >= arr [ i ] : count += 1 else : if count > max_val : max_val = count count = 1 return max ( max_val , count )                         def main ( ) : NEW_LINE


n = int ( input ( ) ) arr = list ( map ( int , input ( ) . split ( ) ) ) maxcount , count = 1 , 1 for i in range ( n - 1 ) : if arr [ i ] > arr [ i + 1 ] : count = 1 else : count += 1 if count > maxcount : maxcount = countprint ( maxcount ) NEW_LINE


n = int ( input ( ) ) x = [ int ( i ) for i in input ( ) . split ( ) ] counter = 1 maxcounter = 1 for i in range ( 1 , n ) : if x [ i ] >= x [ i - 1 ] : counter += 1 if counter > maxcounter : maxcounter = counter elif x [ i ] < x [ i - 1 ] : counter = 1 print ( maxcounter ) NEW_LINE


import java . util . * ; import java . lang . * ; import java . io . * ; public class Codechef {


import java . util . * ; import java . lang . * ; import java . io . * ; public class KefaAndFirstSteps { public static void main ( String args [ ] ) throws IOException { BufferedReader br = new BufferedReader ( new InputStreamReader ( System . in ) ) ; BufferedWriter bw = new BufferedWriter ( new OutputStreamWriter ( System . out ) ) ; int n = Integer . parseInt ( br . readLine ( ) ) ; String arr [ ] = br . readLine ( ) . trim ( ) . split ( " \\ s + " ) ; int i = 0 , j = 1 ; if ( n == 1 ) { bw . write ( "1" ) ; } else { int max = Integer . MIN_VALUE ; int count = 1 ; for ( i = 0 ; i < n - 1 ; i ++ ) { int val1 = Integer . parseInt ( arr [ i ] ) ; int val2 = Integer . parseInt ( arr [ i + 1 ] ) ; if ( val1 <= val2 ) { count ++ ; } else { count = 1 ; } if ( count > max ) { max = count ; } } bw . write ( max + " \n " ) ; } bw . close ( ) ; } }


import java . io . BufferedReader ; import java . io . IOException ; import java . io . InputStreamReader ;


import java . util . Scanner ;    public class Main { public static void main ( String [ ] args ) { Scanner sc = new Scanner ( System . in ) ; int n = sc . nextInt ( ) ; int [ ] a = new int [ n ] ; int i , v , cnt1 = 1 , cnt2 = 0 ; for ( i = 0 ; i < n ; i ++ ) { v = sc . nextInt ( ) ; a [ i ] = v ; } for ( i = 1 ; i < n ; i ++ ) { if ( a [ i ] >= a [ i - 1 ] ) { cnt1 ++ ; } else { cnt2 = Math . max ( cnt1 , cnt2 ) ; cnt1 = 1 ; } } cnt2 = Math . max ( cnt1 , cnt2 ) ; System . out . println ( cnt2 ) ; } }


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

n = int ( input ( ) ) s = input ( ) s = s . split ( ' ? ' ) fl = 0 c = 0 for i in s : if len ( i ) == 0 : c = 1 for j in range ( 0 , len ( i ) - 1 ) : if i [ j ] == i [ j + 1 ] : fl = 1 break if fl == 1 : break   if fl : print ( ' No ' ) else : if c == 0 : for i in range ( 0 , len ( s ) - 1 ) : if s [ i ] [ len ( s [ i ] ) - 1 ] == s [ i + 1 ] [ 0 ] : c = 1 if c == 0 : print ( ' No ' ) else : print ( ' Yes ' ) else : print ( " Yes " ) NEW_LINE


n = int ( input ( ) ) s = input ( ) a = [ ' MM ' , ' YY ' , ' CC ' ] c = 1 for i in a : if ( i in s ) : c = 0 breakif ( c == 0 ) : print ( ' No ' ) elif ( s [ 0 ] == ' ? ' or s [ n - 1 ] == ' ? ' ) : print ( ' Yes ' ) else : if ( ' ? ? ' in s or ' Y ? Y ' in s or ' M ? M ' in s or ' C ? C ' in s ) : print ( ' Yes ' ) else : print ( ' No ' ) NEW_LINE


n = int ( input ( ) ) s = str ( input ( ) ) def get ( index ) : if index >= 0 and index < n : return s [ index ] return ' F ' output = " No " p = 0 while p < n : if s [ p ] == ' ? ' : sp = p + 1 length = 1 while sp < n : if s [ sp ] == ' ? ' : sp += 1 length += 1 else : break if get ( p - 1 ) == get ( sp ) or get ( p - 1 ) == ' F ' or get ( sp ) == ' F ' or length > 1 : output = " Yes " break p = sp else : p += 1 for j in range ( n - 1 ) : if s [ j ] != ' ? ' and s [ j + 1 ] != ' ? ' : if s [ j ] == s [ j + 1 ] : output = " No " breakprint ( output ) NEW_LINE


def check ( s ) : for i in range ( 1 , n ) : if s [ i ] == s [ i - 1 ] and s [ i ] != " ? " : return False return True   n = int ( input ( ) ) s = input ( ) if not check ( s ) : print ( " NO " ) exit ( )   ans = " NO " if s [ 0 ] == " ? " or s [ - 1 ] == " ? " : print ( " YES " ) exit ( ) for i in range ( n - 1 ) : if ( s [ i ] == " ? " and s [ i + 1 ] == " ? " ) or ( i > 0 and s [ i - 1 ] == s [ i + 1 ] and s [ i ] == " ? " ) : NEW_LINE


import sys , mathfrom collections import deque , defaultdictimport operator as opfrom functools import reducefrom itertools import permutations   NEW_LINE


import java . util . * ; import java . io . * ; import java . math . BigInteger ; import java . text . * ; public class Main implements Runnable { static int mod = 1000_000_007 ; static long lim = ( long ) 1e9 + 6 ; static long mod1 = 998244353 ; static boolean fileIO = false ; static FastScanner f ; static int inf = 2000_000_000 ; static PrintWriter pw = new PrintWriter ( System . out ) ; static Scanner S = new Scanner ( System . in ) ; static long x0 ; static long y0 ; static long iinf = Long . MAX_VALUE ; static double eps = ( double ) 1e-6 ; public static void solve ( ) { int n = f . ni ( ) ; char s [ ] = f . next ( ) . toCharArray ( ) ;   int cnt = 0 ; boolean ok = true ; for ( int i = 0 ; i + 1 < s . length ; ++ i ) { if ( s [ i ] == ' ? ' ) { ++ cnt ; continue ; } ok &= s [ i ] != s [ i + 1 ] ; }   if ( ! ok ) { pn ( " No " ) ; return ; }   if ( s [ 0 ] == ' ? ' || s [ n - 1 ] == ' ? ' ) { pn ( " Yes " ) ; return ; }   for ( int i = 1 ; i + 1 < n ; ++ i ) { if ( s [ i ] == ' ? ' && s [ i - 1 ] == s [ i + 1 ] ) { pn ( " Yes " ) ; return ; } }   for ( int i = 0 ; i + 1 < n ; ++ i ) { if ( s [ i ] == ' ? ' && s [ i + 1 ] == ' ? ' ) { pn ( " Yes " ) ; return ; } }   pn ( " No " ) ; } public static void main ( String [ ] args ) throws IOException , InterruptedException { Thread thread = new Thread ( null , new Main ( ) , " F * uckit " , 1 << 28 ) ; thread . start ( ) ; thread . join ( ) ; } public void run ( ) { f = new FastScanner ( System . in ) ;


import java . util . Scanner ;   public class A957 {   public static void main ( String [ ] args ) { Scanner in = new Scanner ( System . in ) ; int N = in . nextInt ( ) ; char [ ] S = in . next ( ) . toCharArray ( ) ; boolean noSolution = false ; boolean moreSolutions = S [ 0 ] == ' ? ' || S [ N - 1 ] == ' ? ' ; for ( int n = 1 ; n < N ; n ++ ) { if ( S [ n - 1 ] == S [ n ] ) { if ( S [ n ] == ' ? ' ) { moreSolutions = true ; } else { noSolution = true ; } } } for ( int n = 2 ; n < N ; n ++ ) { if ( S [ n - 2 ] == S [ n ] && S [ n - 1 ] == ' ? ' ) { moreSolutions = true ; } } boolean answer = ! noSolution && moreSolutions ; System . out . println ( answer ? " Yes " : " No " ) ; }   }


import java . io . BufferedReader ; import java . io . IOException ; import java . io . InputStreamReader ; import java . io . PrintWriter ; import java . util . StringTokenizer ;   public class Zad1461B {   public static void main ( String [ ] args ) {

from sys import stdint = int ( input ( ) ) NEW_LINE for _ in range ( t ) : n , m = map ( int , stdin . readline ( ) . split ( ) ) NEW_LINE a = [ list ( stdin . readline ( ) ) for i in range ( n ) ] NEW_LINE cnt = 0 NEW_LINE dp = [ [ 0 ] * m for i in range ( n ) ] NEW_LINE for i in range ( n ) [ : : - 1 ] : for NEW_LINE j in range ( m ) : NEW_LINE if a [ i ] [ j ] == " * " : dp [ i ] [ j ] = 1 + ( min ( dp [ i + 1 ] [ j - 1 ] , dp [ i + 1 ] [ j ] , dp [ i + 1 ] [ j + 1 ] ) if not ( i == n - 1 or j == 0 or j == m - 1 ) else 0 ) NEW_LINE cnt += dp [ i ] [ j ] NEW_LINE print ( cnt ) NEW_LINE


import syst = int ( sys . stdin . readline ( ) ) NEW_LINE for _ in range ( t ) : r , c = map ( int , sys . stdin . readline ( ) . split ( ) ) NEW_LINE grid = [ [ 0 for i in range ( c + 2 ) ] ] + [ [ 0 ] for j in range ( r ) ] + [ [ 0 for i in range ( c + 2 ) ] ] NEW_LINE for i in range ( 1 , r + 1 ) : inp = sys . stdin . readline ( ) . strip ( ) NEW_LINE for j in range ( c ) : if NEW_LINE inp [ j ] == " * " : grid [ i ] . append ( 1 ) else : grid [ i ] . append ( 0 ) NEW_LINE grid [ i ] . append ( 0 ) NEW_LINE


for _ in range ( int ( input ( ) ) ) : n , m = map ( int , input ( ) . split ( ) ) NEW_LINE arr = [ list ( input ( ) ) for i in range ( n ) ] NEW_LINE dp = [ [ 0 ] * ( m + 2 ) for i in range ( n + 1 ) ] NEW_LINE ans = 0 NEW_LINE for i in range ( n - 1 , - 1 , - 1 ) : for NEW_LINE j in range ( 1 , m + 1 ) : NEW_LINE if arr [ i ] [ j - 1 ] == ' * ' : dp [ i ] [ j ] = 1 + min ( dp [ i + 1 ] [ j - 1 ] , dp [ i + 1 ] [ j ] , dp [ i + 1 ] [ j + 1 ] ) NEW_LINE ans += dp [ i ] [ j ] NEW_LINE print ( ans ) NEW_LINE


def solve ( ) : n , m = map ( int , input ( ) . split ( ) ) NEW_LINE a = [ ] NEW_LINE for i in range ( n ) : a . append ( input ( ) )   dp = [ ] NEW_LINE for i in range ( n ) : dp . append ( [ ] ) NEW_LINE for j in range ( m ) : dp [ i ] . append ( ( 1 if a [ i ] [ j ] == ' * ' else 0 ) if j == 0 else dp [ i ] [ j - 1 ] + ( 1 if a [ i ] [ j ] == ' * ' else 0 ) )   answer = 0 NEW_LINE for x in range ( n ) : for NEW_LINE y in range ( m ) : NEW_LINE if a [ x ] [ y ] == ' . ' : continue   for level in range ( min ( n - x , m - y , y + 1 ) ) : if NEW_LINE dp [ x + level ] [ y + level ] - ( 0 if y - level - 1 < 0 else dp [ x + level ] [ y - level - 1 ] ) != level * 2 + 1 : NEW_LINE break   answer += 1   print ( answer )     tests = int ( input ( ) )   while ( tests > 0 ) : solve ( ) NEW_LINE tests = tests - 1 NEW_LINE


import java . util . * ;   public class Main { public static void main ( String [ ] args ) { Scanner in = new Scanner ( System . in ) ; int t = in . nextInt ( ) ;   while ( t -- > 0 ) { int n , m ; long ans ; n = in . nextInt ( ) ; m = in . nextInt ( ) ; ans = 0 ; int [ ] [ ] arr = new int [ n + 1 ] [ m + 2 ] ;   for ( int i = 0 ; i < n ; i ++ ) { String st = in . next ( ) ; for ( int j = 0 ; j < m ; j ++ ) { if ( st . charAt ( j ) == ' * ' ) arr [ i ] [ j + 1 ] = 1 ; } }   for ( int i = n ; i > 0 ; i -- ) { for ( int j = 1 ; j <= m ; j ++ ) { if ( arr [ i - 1 ] [ j ] > 0 ) { arr [ i - 1 ] [ j ] = 1 + Math . min ( arr [ i ] [ j + 1 ] , Math . min ( arr [ i ] [ j - 1 ] , arr [ i ] [ j ] ) ) ; ans += arr [ i - 1 ] [ j ] ; } } }   System . out . println ( ans ) ; } } }


import java . io . * ; import java . lang . * ; import java . util . * ; import java . io . * ; import java . util . * ; public class Main { static Scanner scanner = new Scanner ( System . in ) ; public static void main ( String [ ] args ) { int t = scanner . nextInt ( ) ; while ( t -- > 0 ) { int n = scanner . nextInt ( ) ; int m = scanner . nextInt ( ) ; char c [ ] [ ] = new char [ n ] [ m ] ; int [ ] [ ] a = new int [ n ] [ m ] ;


import java . util . ArrayList ; import java . util . Arrays ; import java . util . Collections ; import java . util . Scanner ; import java . lang . Math ; public class Account { public static void main ( String [ ] args ) { Scanner sc = new Scanner ( System . in ) ; int n = sc . nextInt ( ) ; long [ ] arr = new long [ n ] ; for ( int i = 0 ; i < n ; i ++ ) { arr [ i ] = sc . nextLong ( ) ; }

a = int ( input ( ) ) I = lambda : list ( map ( int , input ( ) . split ( ) ) ) b = I ( ) if a >= 2 : ma = 2 current = 2 for i in range ( 2 , len ( b ) ) : if b [ i - 2 ] + b [ i - 1 ] == b [ i ] : current += 1 else : current = 2 if current > ma : ma = current print ( ma ) elif a == 1 : print ( 1 ) else : print ( 0 ) NEW_LINE


n = int ( input ( ) ) a = list ( map ( int , input ( ) . split ( ) ) ) ans = 0 cnt = 2 for i in range ( 2 , n ) : if a [ i ] == ( a [ i - 1 ] + a [ i - 2 ] ) : cnt += 1 else : cnt = 2 ans = max ( ans , cnt ) if n <= 2 : ans = nprint ( ans )           NEW_LINE


n = int ( input ( ) ) arr = list ( map ( int , input ( ) . split ( ) ) )   if n <= 2 : print ( n ) else : max_seg = 2 curr = 2   for i in range ( 2 , len ( arr ) ) : if arr [ i - 2 ] + arr [ i - 1 ] == arr [ i ] : curr += 1 else : max_seg = max ( curr , max_seg ) curr = 2 max_seg = max ( curr , max_seg ) print ( max_seg ) NEW_LINE


n = int ( input ( ) ) x = list ( map ( int , input ( ) . split ( ) ) ) a , m = 2 , 2 if n <= 1 : m = 1 for i in range ( 2 , n ) : if x [ i ] == x [ i - 1 ] + x [ i - 2 ] : a += 1 else : a = 2 m = max ( m , a ) print ( m ) NEW_LINE


import java . util . Scanner ;   public class FIbonacciSegment {   private static int dp ( int n , int [ ] a ) { if ( n == 1 || n == 2 ) return n ; int [ ] dp = new int [ n ] ; dp [ 0 ] = 1 ; dp [ 1 ] = 2 ; int max = 0 ; for ( int i = 2 ; i < n ; i ++ ) { if ( a [ i ] == a [ i - 1 ] + a [ i - 2 ] ) dp [ i ] = dp [ i - 1 ] + 1 ; else dp [ i ] = 2 ; max = Math . max ( max , dp [ i ] ) ; } return max ; }   private static int solve ( int n , int [ ] a ) { int max = 0 ; if ( n == 1 || n == 2 ) max = n ; else { int i , j = 0 ; for ( i = 2 ; i < n ; i ++ ) { if ( a [ i ] != ( a [ i - 1 ] + a [ i - 2 ] ) ) { max = Math . max ( max , i - j ) ; j = i - 1 ; } } max = Math . max ( max , i - j ) ; } return max == 0 ? 2 : max ; }   public static void main ( String [ ] args ) { Scanner sc = new Scanner ( System . in ) ; int n = sc . nextInt ( ) ; int [ ] a = new int [ n ] ; for ( int i = 0 ; i < n ; i ++ ) { a [ i ] = sc . nextInt ( ) ; } System . out . println ( dp ( n , a ) ) ; sc . close ( ) ; } }


import java . util . Scanner ;   public class FIbonacciSegment {   private static int solve ( int n , int [ ] a ) { int max = 0 ; if ( n == 1 || n == 2 ) max = n ; else { int i , j = 0 ; for ( i = 2 ; i < n ; i ++ ) { if ( a [ i ] != ( a [ i - 1 ] + a [ i - 2 ] ) ) { max = Math . max ( max , i - j ) ; j = i - 1 ; } } max = Math . max ( max , i - j ) ; } return max == 0 ? 2 : max ; }   public static void main ( String [ ] args ) { Scanner sc = new Scanner ( System . in ) ; int n = sc . nextInt ( ) ; int [ ] a = new int [ n ] ; for ( int i = 0 ; i < n ; i ++ ) { a [ i ] = sc . nextInt ( ) ; } System . out . println ( solve ( n , a ) ) ; sc . close ( ) ; } }


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


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


import java . util . Scanner ; public class Solution { public static void main ( String [ ] args ) {   Scanner ss = new Scanner ( System . in ) ; int n = ss . nextInt ( ) ; int sum = 0 ; int max = - 1 ; for ( int i = 0 ; i < n ; i ++ ) { int x = ss . nextInt ( ) ; if ( x > max ) max = x ; sum += x ; } int k = max ; while ( k * n - sum <= sum ) { k ++ ; } System . out . println ( k ) ; } }

def Awruk_wins ( stds_votes , max_vote ) : Elodreip_votes = sum ( stds_votes ) Awruk_votes = ( len ( stds_votes ) * max_vote ) - Elodreip_votes if Awruk_votes > Elodreip_votes : return True return False       no_of_stds = int ( input ( ) )   votes = list ( map ( int , input ( ) . split ( ) ) )   max_votes = max ( votes )   while not ( Awruk_wins ( votes , max_votes ) ) : max_votes += 1   print ( max_votes )   NEW_LINE


n = int ( input ( ) ) a = list ( map ( int , input ( ) . split ( ) ) ) x = max ( a ) s = 0 while ( sum ( a ) >= s ) : c = 0 for i in a : c = c + ( x - i ) s = c x = x + 1 print ( x - 1 ) NEW_LINE


n = int ( input ( ) ) arr = list ( map ( int , input ( ) . split ( ) ) )   given = sum ( arr ) needed = given * 2 + 1   for_each = ( needed + n - 1 ) // n   print ( max ( for_each , max ( arr ) ) )   NEW_LINE


n = int ( input ( ) ) lst = [ int ( i ) for i in input ( ) . split ( ) ] print ( max ( ( 2 * sum ( lst ) + n ) // n , max ( lst ) ) ) NEW_LINE


x = int ( input ( ) ) votes1 = list ( map ( int , input ( ) . split ( ) ) ) votes2 = [ ] pivot = max ( votes1 ) for i in range ( pivot , 202 ) : for j in range ( len ( votes1 ) ) : vote = i - votes1 [ j ] votes2 . append ( vote ) if sum ( votes2 ) > sum ( votes1 ) : print ( i ) break else : votes2 = [ ] NEW_LINE


import java . io . * ; import java . util . * ; import java . text . * ; import java . math . * ; import java . util . regex . * ;   public class Endsem { public static void main ( String [ ] args ) { Scanner sc = new Scanner ( System . in ) ; int n = sc . nextInt ( ) ; int [ ] arr = new int [ n ] ; int sum = 0 , sum1 = 0 ; if ( n >= 1 && n <= 100 ) { for ( int i = 0 ; i < n ; i ++ ) { int a = sc . nextInt ( ) ; if ( a >= 1 && a <= 100 ) arr [ i ] = a ; } int max = 0 ; for ( int i = 0 ; i < n ; i ++ ) { if ( max <= arr [ i ] ) max = arr [ i ] ; sum += arr [ i ] ; } int x = max ; while ( true ) { sum1 = 0 ; for ( int j = 0 ; j < n ; j ++ ) { sum1 += ( x - arr [ j ] ) ; } if ( sum1 > sum ) { System . out . println ( x ) ; break ; } else x ++ ; } } }   }


import java . io . BufferedReader ; import java . io . InputStreamReader ; import java . util . Arrays ;    public class Solution {    public static void main ( String [ ] args ) throws Exception {   BufferedReader br = new BufferedReader ( new InputStreamReader ( System . in ) ) ;   String input = br . readLine ( ) ; int n = Integer . parseInt ( input . replaceAll ( " , " , " " ) ) ; input = br . readLine ( ) ; int [ ] a = Arrays . stream ( input . split ( " ▁ " ) ) . mapToInt ( Integer :: parseInt ) . toArray ( ) ; int k = a [ 0 ] ; for ( int i = 0 ; i < n ; i ++ ) { if ( a [ i ] > k ) k = a [ i ] ; } int A = 0 ; int B = 0 ; for ( int i = 0 ; i < n ; i ++ ) { B += a [ i ] ; A += k - a [ i ] ;   } int diff = B - A ; if ( diff >= 0 ) {   System . out . println ( ( diff / n ) + k + 1 ) ;   } else { System . out . println ( k ) ; }   }    }


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 n = 3 ; long ans = 0 , sum = 0 ; for ( int i = 0 ; i < n ; i ++ ) { long b = fs . nextLong ( ) ; sum += b ; } ans = sum - 1 ; 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 ( ) ) ; } } }

for _ in range ( int ( input ( ) ) ) : a , b , c = sorted ( [ int ( x ) for x in input ( ) . split ( ) ] ) NEW_LINE print ( a + b + c - 1 ) NEW_LINE


for i in range ( int ( input ( ) ) ) : L = list ( map ( int , input ( ) . split ( ) ) ) NEW_LINE L . sort ( ) NEW_LINE a = L [ 0 ] NEW_LINE b = L [ 1 ] NEW_LINE c = L [ 2 ] NEW_LINE print ( int ( ( ( c - a ) ** 2 + b ** 2 ) ** 0.5 + 0.5 ) ) NEW_LINE


t = int ( input ( ) ) NEW_LINE for i in range ( t ) : a , b , c = map ( int , input ( ) . split ( ) ) NEW_LINE d = a + b + c - 1 NEW_LINE if a < b + c + d and b < a + c + d and c < a + b + d and d < a + b + c : print ( d ) NEW_LINE


import sys ; NEW_LINE import collections ; NEW_LINE import math ; NEW_LINE import bisect ; NEW_LINE import heapqinf = sys . maxsizedef NEW_LINE get_ints ( ) : NEW_LINE return map ( int , sys . stdin . readline ( ) . strip ( ) . split ( ) ) NEW_LINE def get_array ( ) : return list ( map ( int , sys . stdin . readline ( ) . strip ( ) . split ( ) ) ) NEW_LINE def input ( ) : return sys . stdin . readline ( ) . strip ( ) NEW_LINE mod = 1000000007   for _ in range ( int ( input ( ) ) ) : a , b , c = sorted ( get_ints ( ) ) NEW_LINE print ( c + 1 ) NEW_LINE


a = int ( input ( ) ) NEW_LINE for i in range ( a ) : b , c , d = list ( map ( int , input ( ) . split ( ) ) ) NEW_LINE print ( max ( b , c , d ) ) NEW_LINE


import java . io . * ; import java . util . * ; public class Temp { static class Reader { final private int BUFFER_SIZE = 1 << 16 ; private DataInputStream din ; private byte [ ] buffer ; private int bufferPointer , bytesRead ; public Reader ( ) { din = new DataInputStream ( System . in ) ; buffer = new byte [ BUFFER_SIZE ] ; bufferPointer = bytesRead = 0 ; } public Reader ( String file_name ) throws IOException { din = new DataInputStream ( new FileInputStream ( file_name ) ) ; buffer = new byte [ BUFFER_SIZE ] ; bufferPointer = bytesRead = 0 ; } public String readLine ( ) throws IOException { byte [ ] buf = new byte [ 64 ] ;


import java . util . Scanner ;   public class A1422 {   public static void main ( String [ ] args ) { Scanner in = new Scanner ( System . in ) ; int T = in . nextInt ( ) ; for ( int t = 0 ; t < T ; t ++ ) { int A = in . nextInt ( ) ; int B = in . nextInt ( ) ; int C = in . nextInt ( ) ; int D = Math . max ( A , Math . max ( B , C ) ) ; System . out . println ( D ) ; } }   }


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


import java . io . ByteArrayInputStream ; import java . io . IOException ; import java . io . InputStream ; import java . io . PrintWriter ; import java . util . * ; import java . io . * ; import java . math . * ; public class Main { InputStream is ; PrintWriter out ; String INPUT = " " ;

from types import GeneratorTypedef bootstrap ( f , stack = [ ] ) : def wrappedfunc ( * args , ** kwargs ) : if stack : return f ( * args , ** kwargs ) else : to = f ( * args , ** kwargs ) while True : if type ( to ) is GeneratorType : stack . append ( to ) to = next ( to ) else : stack . pop ( ) if not stack : break to = stack [ - 1 ] . send ( to ) return to return wrappedfunc   def main ( ) : n = int ( input ( ) ) p = [ - 1 for _ in range ( n + 1 ) ] c = [ - 1 for _ in range ( n + 1 ) ] children = [ [ ] for _ in range ( n + 1 ) ] for i in range ( 1 , n + 1 ) : pp , cc = readIntArr ( ) p [ i ] = pp c [ i ] = cc if pp == 0 : NEW_LINE


n = int ( input ( ) ) g = [ [ ] for _ in range ( n + 1 ) ] c = [ 0 ] for i in range ( 1 , n + 1 ) : p , ci = map ( int , input ( ) . split ( ) ) g [ p ] . append ( i ) c . append ( ci ) b = True   def dfs ( i ) : global b l = [ ] for j in g [ i ] : l . extend ( dfs ( j ) )   if c [ i ] > len ( l ) : b = False l . insert ( c [ i ] , i ) return l   l = dfs ( g [ 0 ] [ 0 ] ) NEW_LINE


import ioimport osimport sys     from collections import Counter , defaultdict , deque   sys . setrecursionlimit ( 10 ** 5 )     def solve ( N , PC ) : children = [ [ ] for i in range ( N ) ] cost = [ None for i in range ( N ) ] root = None for i , ( p , c ) in enumerate ( PC ) : cost [ i ] = c p -= 1 if p != - 1 : children [ p ] . append ( i ) else : root = i   def getOrder ( node ) : ret = [ ] for child in children [ node ] : ret . extend ( getOrder ( child ) ) i = cost [ node ] if not ( 0 <= i <= len ( ret ) ) : print ( " NO " ) exit ( ) return ret [ : i ] + [ node ] + ret [ i : ]   order = getOrder ( root )   nodeToVal = { } for v , node in enumerate ( order ) : nodeToVal [ node ] = str ( v + 1 )   return " YES \n " + " ▁ " . join ( nodeToVal [ i ] for i in range ( N ) )     if __name__ == " _ _ main _ _ " : input = io . BytesIO ( os . read ( 0 , os . fstat ( 0 ) . st_size ) ) . readline   ( N , ) = [ int ( x ) for x in input ( ) . split ( ) ] PC = [ [ int ( x ) for x in input ( ) . split ( ) ] for i in range ( N ) ] ans = solve ( N , PC ) print ( ans ) NEW_LINE


import java . util . ArrayList ; import java . util . Scanner ;   public class antiqueItems { public static void main ( String [ ] args ) { Scanner sc = new Scanner ( System . in ) ; long total_items = sc . nextLong ( ) ; long total_money = sc . nextLong ( ) ; int count = 0 ; ArrayList < Integer > al = new ArrayList < > ( ) ; for ( int i = 0 ; i < total_items ; i ++ ) { int a = sc . nextInt ( ) ; boolean flag = false ; for ( int j = 0 ; j < a ; j ++ ) { long b = sc . nextLong ( ) ; if ( flag == false ) { if ( b < total_money ) { count ++ ; flag = true ; al . add ( i + 1 ) ;

n , v = map ( int , input ( ) . split ( ) ) l1 = [ ]   for i in range ( n ) : l = list ( map ( int , input ( ) . split ( ) ) ) if ( min ( l [ 1 : ] ) < v ) : l1 . append ( ( i , min ( l [ 1 : ] ) ) ) sorted ( l1 , key = lambda l1 : l1 [ 1 ] ) print ( len ( l1 ) ) for i in l1 : print ( i [ 0 ] + 1 , end = " ▁ " ) NEW_LINE


import sysfrom functools import lru_cache , cmp_to_keyfrom heapq import merge , heapify , heappop , heappushfrom math import * from collections import defaultdict as dd , deque , Counter as Cfrom itertools import combinations as comb , permutations as permfrom bisect import bisect_left as bl , bisect_right as br , bisect , insortfrom time import perf_counterfrom fractions import Fractionimport copyfrom copy import deepcopyimport timestarttime = time . time ( ) mod = int ( pow ( 10 , 9 ) + 7 ) mod2 = 998244353   def data ( ) : return sys . stdin . readline ( ) . strip ( ) def out ( * var , end = " \n " ) : sys . stdout . write ( ' ▁ ' . join ( map ( str , var ) ) + end ) def L ( ) : return list ( sp ( ) ) def sl ( ) : return list ( ssp ( ) ) def sp ( ) : return map ( int , data ( ) . split ( ) ) def ssp ( ) : return map ( str , data ( ) . split ( ) ) def l1d ( n , val = 0 ) : return [ val for i in range ( n ) ] def l2d ( n , m , val = 0 ) : return [ l1d ( n , val ) for j in range ( m ) ] try : NEW_LINE


n = [ int ( x ) for x in input ( ) . split ( ) ] l = n [ 0 ] u = n [ 1 ] counter = 0 list1 = ' ' ind = 1 for i in range ( l ) : s = [ int ( x ) for x in input ( ) . split ( ) ] ni = s [ 0 ] i = s [ 1 : ] i . sort ( ) for e in range ( s [ 0 ] ) : if u > i [ 0 ] : counter += 1 list1 += str ( ind ) + ' ▁ ' break ind += 1 print ( counter ) print ( list1 ) NEW_LINE


n , k = map ( int , input ( ) . split ( ) ) ans = [ ] r = lambda : list ( map ( int , input ( ) . split ( ) ) ) for x in range ( n ) : seller , * prices = r ( ) if any ( i < k for i in prices ) : ans . append ( x + 1 )     print ( len ( ans ) ) print ( * ans ) NEW_LINE


import java . io . BufferedReader ; import java . io . IOException ; import java . io . InputStreamReader ; import java . io . PrintWriter ; import java . util . Arrays ; import java . util . HashSet ; import java . util . Set ; import java . util . StringTokenizer ;   public class A { public static void main ( String [ ] args ) { FastReader ( ) ; int t = 1 ; while ( t > 0 ) { solve ( ) ; -- t ; } write . flush ( ) ; write . close ( ) ; } static void solve ( ) { int n = ni ( ) ; int v = ni ( ) ; int count = 0 ; boolean status [ ] = new boolean [ n ] ; for ( int i = 0 ; i < n ; ++ i ) { boolean check = false ; int k = ni ( ) ; for ( int j = 0 ; j < k ; ++ j ) { int a = ni ( ) ; if ( a < v ) { check = true ; status [ i ] = true ; } } if ( check ) { ++ count ; } } out ( count ) ; for ( int i = 0 ; i < n ; ++ i ) { if ( status [ i ] ) { ou ( i + 1 + " ▁ " ) ; } } out ( ) ; }


import java . util . HashSet ; import java . util . Iterator ; import java . util . Scanner ; import java . util . Set ; import java . util . TreeSet ;   public class _0653ValeraandAntiqueItems {   public static void main ( String [ ] args ) { Scanner sc = new Scanner ( System . in ) ; int n = sc . nextInt ( ) ; int v = sc . nextInt ( ) ; Set < Integer > sellers = new TreeSet < > ( ) ; for ( int i = 0 ; i < n ; i ++ ) { int k = sc . nextInt ( ) ; for ( int j = 0 ; j < k ; j ++ ) { int price = sc . nextInt ( ) ; if ( price < v ) { sellers . add ( i + 1 ) ; } } } System . out . println ( sellers . size ( ) ) ; Iterator < Integer > it = sellers . iterator ( ) ; while ( it . hasNext ( ) ) { System . out . print ( it . next ( ) + " ▁ " ) ; } }   }


import java . util . * ; import java . lang . * ; import java . io . * ;   public class FastIO { BufferedReader br ; StringTokenizer st ; public FastIO ( ) {


import java . io . BufferedReader ; import java . io . IOException ; import java . io . InputStreamReader ; import java . io . PrintWriter ; import java . util . StringTokenizer ;   import static java . lang . Math . max ;   public class Test { public static void main ( String [ ] args ) {   Reader input = new Reader ( ) ; PrintWriter out = new PrintWriter ( System . out ) ; int n = input . nextInt ( ) ; int [ ] a = new int [ n ] ; for ( int i = 0 ; i < n ; i ++ ) { a [ i ] = input . nextInt ( ) ; }   int sum = 0 ; for ( int x : a ) { sum += x ; }   int result = 0 ; for ( int x : a ) { if ( ( sum - x ) % 2 == 0 ) { result ++ ; } } out . println ( result ) ; out . close ( ) ; }   static class Reader { BufferedReader br ; StringTokenizer st ;   public Reader ( ) { br = new BufferedReader ( new InputStreamReader ( System . in ) ) ; }   String next ( ) {   while ( st == null || ! st . hasMoreElements ( ) ) { try { st = new StringTokenizer ( br . readLine ( ) ) ; } catch ( IOException ex ) { ex . printStackTrace ( ) ; } } return st . nextToken ( ) ; }   String nextLine ( ) {   String str = " " ; try { str = br . readLine ( ) ; } catch ( IOException ex ) { ex . printStackTrace ( ) ; } return str ; }   int nextInt ( ) { return Integer . parseInt ( next ( ) ) ; }   long nextLong ( ) { return Long . parseLong ( next ( ) ) ; }   double nextDouble ( ) { return Double . parseDouble ( next ( ) ) ; } } }

n = int ( input ( ) ) l = list ( map ( int , input ( ) . split ( ) ) ) ce = 0 co = 0 s = 0 for i in l : if i % 2 == 0 : ce += 1 else : co += 1 s += i   if s % 2 == 0 : print ( ce ) else : print ( co ) NEW_LINE


n = int ( input ( ) ) l = list ( map ( int , input ( ) . split ( ) ) ) c = 0 if ( sum ( l ) % 2 == 0 ) : for i in l : if ( i % 2 == 0 ) : c = c + 1 else : for i in l : if ( i % 2 != 0 ) : c = c + 1 print ( c ) NEW_LINE


n = int ( input ( ) ) l = [ int ( i ) for i in input ( ) . split ( ) ] [ : n ] NEW_LINE


n = int ( input ( ) ) l = [ int ( i ) for i in input ( ) . split ( ) ] [ : n ] count = 0 for i in l : s = sum ( l ) - i if ( s % 2 == 0 ) : count += 1   print ( count )   NEW_LINE


n , y , x , mm , count = int ( input ( ) ) , 0 , 0 , input ( ) , 0 arr = mm . split ( " ▁ " ) while ( n != 0 ) : m = int ( arr [ count ] ) if ( m % 2 == 0 ) : x += 1 else : y += 1 n -= 1 count += 1 if ( y % 2 == 1 ) : print ( y ) else : print ( x ) NEW_LINE


import java . util . Scanner ; import java . io . BufferedReader ; import java . io . IOException ; import java . io . InputStreamReader ; import java . io . PrintWriter ; import java . util . StringTokenizer ;   public class Cv {


import java . util . * ; import java . util . Scanner ; public class Main { public static void main ( String [ ] args ) { Scanner sc = new Scanner ( System . in ) ; int bags = sc . nextInt ( ) ; int odds = 0 ; int evens = 0 ; for ( int i = 0 ; i < bags ; i ++ ) { int cookies = sc . nextInt ( ) ;   if ( cookies % 2 == 0 ) { evens ++ ; } else odds ++ ; }   if ( odds % 2 == 1 ) { System . out . print ( odds ) ; } else System . out . print ( evens ) ; } }


import java . io . BufferedReader ; import java . io . IOException ; import java . io . InputStreamReader ; import java . util . * ;   public class experiment {   static int M = 1_000_000_007 ; static int INF = Integer . MAX_VALUE ; static final FastScanner fs = new FastScanner ( ) ;


import java . io . * ; import java . util . * ;   public class Main { public static void main ( String [ ] args ) throws Exception { int t = 1 ;

n = int ( input ( ) ) t1 = [ ] t2 = [ ] for _ in range ( n ) : t , w = map ( int , input ( ) . split ( ) ) if t == 1 : t1 . append ( w ) else : t2 . append ( w ) t1 . sort ( ) t2 . sort ( ) n1 = len ( t1 ) n2 = len ( t2 ) p1 = [ 0 ] p2 = [ 0 ] for i in range ( n1 ) : p1 . append ( p1 [ - 1 ] + t1 [ i ] ) for i in range ( n2 ) : p2 . append ( t2 [ i ] + p2 [ - 1 ] ) ans = 1 while True : am = False b = 0 while 2 * b <= ans : a = ans - 2 * b if a <= n1 and b <= n2 : if p1 [ n1 - a ] + p2 [ n2 - b ] <= ans : am = True break b += 1 if am : print ( ans ) break ans += 1 NEW_LINE


n = int ( input ( ) )   t = [ ] for i in range ( n ) : e = list ( map ( int , input ( ) . split ( ) ) ) t . append ( e )   size = 0 size2 = 0 for i in t : size += i [ 0 ] size2 += i [ 1 ]   matrix = [ [ - 1000 ] * ( size + 1 ) for i in range ( n ) ] for i in range ( n ) : matrix [ i ] [ 0 ] = 0   for i in range ( n ) : for j in range ( 1 , size + 1 ) : if t [ i ] [ 0 ] <= j : matrix [ i ] [ j ] = max ( matrix [ i - 1 ] [ j ] , matrix [ i - 1 ] [ j - t [ i ] [ 0 ] ] + t [ i ] [ 1 ] ) else : matrix [ i ] [ j ] = matrix [ i - 1 ] [ j ]           for i in range ( 1 , size + 1 ) : if i >= size2 - matrix [ - 1 ] [ i ] : print ( i ) break NEW_LINE


n = int ( input ( ) )   t = [ ] for i in range ( n ) : e = list ( map ( int , input ( ) . split ( ) ) ) t . append ( e )   size = 0 size2 = 0 for i in t : size += i [ 0 ] size2 += i [ 1 ]   matrix = [ [ - 1000 ] * ( size + 1 ) for i in range ( n ) ] for i in range ( n ) : matrix [ i ] [ 0 ] = 0   for i in range ( n ) : for j in range ( 1 , size + 1 ) : if t [ i ] [ 0 ] <= j : matrix [ i ] [ j ] = max ( matrix [ i - 1 ] [ j ] , matrix [ i - 1 ] [ j - t [ i ] [ 0 ] ] + t [ i ] [ 1 ] ) else : matrix [ i ] [ j ] = matrix [ i - 1 ] [ j ] NEW_LINE


n = int ( input ( ) )   t = [ ] for i in range ( n ) : e = list ( map ( int , input ( ) . split ( ) ) ) t . append ( e )   size = 0 size2 = 0 for i in t : size += i [ 0 ] size2 += i [ 1 ]   matrix = [ [ - 1000 ] * ( size + 1 ) for i in range ( n ) ]   for i in range ( n ) : matrix [ i ] [ 0 ] = 0   for i in range ( n ) : for j in range ( 1 , size + 1 ) : if t [ i ] [ 0 ] <= j : matrix [ i ] [ j ] = max ( matrix [ i - 1 ] [ j ] , matrix [ i - 1 ] [ j - t [ i ] [ 0 ] ] + t [ i ] [ 1 ] ) else : matrix [ i ] [ j ] = matrix [ i - 1 ] [ j ]   for i in range ( 1 , size + 1 ) : if i >= size2 - matrix [ - 1 ] [ i ] : print ( i ) break NEW_LINE


import java . util . * ; import java . io . * ; public class PartialReplacement {    public static void main ( String [ ] args ) throws java . lang . Exception { BufferedReader br = new BufferedReader ( new InputStreamReader ( System . in ) ) ; String s = br . readLine ( ) ; int c = 0 ; for ( int i = 0 ; i < s . length ( ) ; i ++ ) { char ch = s . charAt ( i ) ; if ( ch == ' H ' || ch == ' Q ' || ch == '9' ) { c = 1 ; System . out . println ( " YES " ) ; break ; } } if ( c == 0 ) { System . out . println ( " NO " ) ; } } }

s = input ( ) if ' H ' in s or ' Q ' in s or '9' in s : print ( ' YES ' ) else : print ( ' NO ' ) NEW_LINE


s = input ( ) count = 0 for i in range ( len ( s ) ) : if s [ i ] == " H " or s [ i ] == " Q " or s [ i ] == "9" : count = count + 1 if count >= 1 : print ( " YES " ) else : print ( " NO " ) NEW_LINE


command = input ( )   if " H " in command or " Q " in command or "9" in command : print ( " YES " ) else : print ( " NO " ) NEW_LINE


command = str ( input ( ) ) if " H " in command or " Q " in command or "9" in command : print ( " YES " ) else : print ( " NO " ) NEW_LINE


s = input ( ) f = 0 for i in s : if ( i == ' H ' ) : f = 1 break elif ( i == ' Q ' ) : f = 1 break elif ( i == '9' ) : f = 1 breakif ( f == 1 ) : print ( " YES " ) else : print ( " NO " ) NEW_LINE


import java . util . * ; import java . lang . * ; import java . io . * ;   public class A_HQ9_ { public static void main ( String [ ] args ) throws java . lang . Exception { FastReader fs = new FastReader ( ) ; char c [ ] = fs . nextLine ( ) . toCharArray ( ) ; boolean hh = false ; for ( int i = 0 ; i < c . length ; i ++ ) { if ( c [ i ] == ' H ' || c [ i ] == ' Q ' || c [ i ] == '9' ) hh = true ;   } if ( hh ) System . out . println ( " YES " ) ; else System . out . println ( " NO " ) ; } 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 ; } } }


import java . util . Scanner ; import java . util . * ;    public class Main { public static void main ( String [ ] args ) { Scanner scan = new Scanner ( System . in ) ; String s = scan . nextLine ( ) ; int n = s . length ( ) ; String l = " ▁ " ; int i = 0 ; while ( n -- != 0 ) { if ( s . charAt ( i ) == ' H ' ) { l = " YES " ; break ; } else if ( s . charAt ( i ) == ' Q ' ) { l = " YES " ; break ; } else if ( s . charAt ( i ) == '9' ) { l = " YES " ; break ; } i ++ ; } if ( n == - 1 ) { System . out . print ( " NO " ) ; } else { System . out . print ( l ) ; } scan . close ( ) ; } }


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 ; import java . util . * ; public class A133 { public static void main ( String args [ ] ) { Scanner sc = new Scanner ( System . in ) ; String inp = sc . nextLine ( ) ; int ans = 0 ; int len = inp . length ( ) ; int i = 0 ; while ( len > 0 ) { int ah = inp . charAt ( i ) ; if ( ah == 72 || ah == 57 || ah == 81 ) { ans ++ ; } len -- ; i ++ ; }


import java . util . * ;    public class Main { public static void main ( String [ ] args ) { Scanner input = new Scanner ( System . in ) ; int n = input . nextInt ( ) ; ArrayList < Long > a = new ArrayList < > ( ) ; for ( int i = 0 ; i < n ; i ++ ) { a . add ( input . nextLong ( ) ) ; } Collections . sort ( a , Collections . reverseOrder ( ) ) ; if ( a . get ( 0 ) >= ( a . get ( 1 ) + a . get ( 2 ) ) ) { System . out . println ( " NO " ) ; } else { System . out . println ( " YES " ) ; for ( int i = 0 ; i < n ; i ++ ) { if ( i != 1 ) System . out . print ( a . get ( i ) + " ▁ " ) ; } System . out . println ( a . get ( 1 ) ) ; } } }

n = int ( input ( ) ) l = list ( map ( int , input ( ) . split ( ) ) ) l . sort ( ) if l [ - 3 ] + l [ - 2 ] > l [ - 1 ] : l [ - 2 ] , l [ - 1 ] = l [ - 1 ] , l [ - 2 ] print ( ' YES ' ) print ( * l ) else : print ( ' NO ' ) NEW_LINE


import bisectimport collectionsimport copyimport functoolsimport heapqimport itertoolsimport mathimport randomimport reimport sysimport timeimport stringfrom typing import List NEW_LINE


n = int ( input ( ) ) a = list ( map ( int , input ( ) . split ( ) ) ) a . sort ( ) if a [ n - 1 ] >= a [ n - 2 ] + a [ n - 3 ] : print ( " NO " ) else : print ( " YES " ) for i in range ( n - 1 , - 1 , - 2 ) : print ( a [ i ] , end = " ▁ " ) for i in range ( n % 2 , n , 2 ) : print ( a [ i ] , end = " ▁ " ) NEW_LINE


n = int ( input ( ) ) mas = sorted ( list ( map ( int , input ( ) . split ( ) ) ) ) if mas [ n - 1 ] >= mas [ n - 2 ] + mas [ n - 3 ] : print ( " NO " ) exit ( ) print ( " YES " ) for i in range ( n - 1 , - 1 , - 2 ) : print ( mas [ i ] , end = " ▁ " ) for i in range ( n % 2 , n , 2 ) : print ( mas [ i ] , end = " ▁ " ) NEW_LINE


import sysdef input ( ) : return sys . stdin . readline ( ) . strip ( ) def iinput ( ) : return int ( input ( ) ) def minput ( ) : return map ( int , input ( ) . split ( ) ) def listinput ( ) : return list ( map ( int , input ( ) . split ( ) ) ) n = iinput ( ) a = listinput ( ) a . sort ( ) if a [ - 2 ] + a [ - 3 ] <= a [ - 1 ] : print ( " NO " ) else : print ( " YES " ) print ( * a [ : - 2 ] , a [ - 1 ] , a [ - 2 ] ) NEW_LINE


import java . util . * ; import java . io . BufferedReader ; import java . io . IOException ; import java . io . InputStreamReader ; import java . util . StringTokenizer ;   public class a { static int [ ] count , count1 ; static long [ ] arr ; static char [ ] ch , ch1 ; static long [ ] darr ; static long [ ] [ ] mat , mat1 ; static int x ; static long maxl ; static double dec ; static String s ;


import java . io . * ; import java . util . * ;   public class Main { public static void main ( String [ ] args ) { InputReader in = new InputReader ( System . in ) ; int n = in . nextInt ( ) ; Integer [ ] a = new Integer [ n ] ; for ( int i = 0 ; i < n ; i ++ ) { a [ i ] = in . nextInt ( ) ; } Arrays . sort ( a ) ; if ( a [ n - 1 ] >= a [ n - 3 ] + a [ n - 2 ] ) { System . out . println ( " NO " ) ; return ; } System . out . println ( " YES " ) ; int i ; for ( i = 0 ; i < n ; i += 2 ) { System . out . print ( a [ i ] + " ▁ " ) ; } if ( i == n + 1 ) for ( i = n - 2 ; i > 0 ; i -= 2 ) { System . out . print ( a [ i ] + " ▁ " ) ; } else { for ( i = n - 1 ; i > 0 ; i -= 2 ) { System . out . print ( a [ i ] + " ▁ " ) ; } } } }   class InputReader { public BufferedReader reader ; public StringTokenizer tokenizer ; public InputReader ( InputStream stream ) { reader = new BufferedReader ( new InputStreamReader ( stream ) , 32768 ) ; tokenizer = null ; } public String next ( ) { while ( tokenizer == null || ! tokenizer . hasMoreTokens ( ) ) { try { tokenizer = new StringTokenizer ( reader . readLine ( ) ) ; } catch ( IOException e ) { throw new RuntimeException ( e ) ; } } return tokenizer . nextToken ( ) ; } public int nextInt ( ) { return Integer . parseInt ( next ( ) ) ; } long nextLong ( ) { return Long . parseLong ( next ( ) ) ; } double nextDouble ( ) { return Double . parseDouble ( next ( ) ) ; } String nextLine ( ) { String str = " " ; try { str = reader . readLine ( ) ; } catch ( IOException e ) { e . printStackTrace ( ) ; } return str ; } }


import java . io . BufferedReader ; import java . io . IOException ; import java . io . InputStreamReader ; import java . util . LinkedList ; import java . util . Queue ;

s = input ( ) x = 0 y = 0 d = dict ( ) d [ ( x , y ) ] = - 1 f = 0 for j in range ( len ( s ) ) : if s [ j ] == " L " : x += - 1 elif s [ j ] == " R " : x += 1 elif s [ j ] == " U " : y += 1 else : y += - 1 if ( x , y ) in d . keys ( ) : f = 1 break elif ( x - 1 , y ) in d . keys ( ) and ( j - d [ x - 1 , y ] ) > 1 : f = 1 break elif ( x + 1 , y ) in d . keys ( ) and ( j - d [ x + 1 , y ] ) > 1 : f = 1 break elif ( x , y + 1 ) in d . keys ( ) and ( j - d [ x , y + 1 ] ) > 1 : f = 1 break elif ( x , y - 1 ) in d . keys ( ) and ( j - d [ x , y - 1 ] ) > 1 : f = 1 break   d [ x , y ] = jif f == 1 : print ( ' BUG ' ) else : print ( " OK " )       NEW_LINE


import sys   path = input ( ) visited = set ( )   def move ( s , x , y ) : if i == ' L ' : x -= 1 elif i == ' R ' : x += 1 elif i == ' U ' : y += 1 else : y -= 1 return x , y x , y = 0 , 0 start = ( x , y ) parent = ( x , y ) visited . add ( start ) for i in path : parent = ( x , y ) x , y = move ( i , x , y ) if ( x , y ) in visited : print ( ' BUG ' ) sys . exit ( ) else : for i in " LRUD " : check = move ( i , x , y ) if check != parent and check in visited : print ( ' BUG ' ) sys . exit ( ) visited . add ( ( x , y ) ) print ( ' OK ' ) NEW_LINE


a = input ( ) b = [ [ 0 , 0 ] ] x = 0 y = 0 z = 1 for i in range ( len ( a ) ) : if a [ i ] == ' R ' : x += 1 if [ x , y ] in b or [ x + 1 , y ] in b or [ x , y + 1 ] in b or [ x , y - 1 ] in b : z = 0 break if a [ i ] == ' L ' : x -= 1 if [ x , y ] in b or [ x - 1 , y ] in b or [ x , y + 1 ] in b or [ x , y - 1 ] in b : z = 0 break if a [ i ] == ' U ' : y += 1 if [ x , y ] in b or [ x + 1 , y ] in b or [ x , y + 1 ] in b or [ x - 1 , y ] in b : z = 0 break if a [ i ] == ' D ' : y -= 1 if [ x , y ] in b or [ x + 1 , y ] in b or [ x - 1 , y ] in b or [ x , y - 1 ] in b : z = 0 break b . append ( [ x , y ] ) if z == 1 : print ( ' OK ' ) else : print ( ' BUG ' ) NEW_LINE


from collections import namedtuple   Pos = namedtuple ( ' Pos ' , ' x ▁ y ' )   s = input ( ) g = { }     def add ( last , pos ) : if last not in g : g [ last ] = set ( ) g [ last ] . add ( pos )   if pos not in g : g [ pos ] = set ( ) g [ pos ] . add ( last )     start = Pos ( 100 , 100 ) last = startok = True   for ch in s : pos = Pos ( 0 , 0 ) if ch == ' L ' : pos = Pos ( last . x - 1 , last . y ) elif ch == ' R ' : pos = Pos ( last . x + 1 , last . y ) elif ch == ' U ' : pos = Pos ( last . x , last . y - 1 ) elif ch == ' D ' : pos = Pos ( last . x , last . y + 1 )   if pos == start : ok = False break   if pos in g : ok = False break   p1 = Pos ( pos . x - 1 , pos . y ) p2 = Pos ( pos . x + 1 , pos . y ) p3 = Pos ( pos . x , pos . y + 1 ) p4 = Pos ( pos . x , pos . y - 1 )     def not_good ( pc ) : return pc != last and pc in g     if not_good ( p1 ) or not_good ( p2 ) or not_good ( p3 ) or not_good ( p4 ) : ok = False break   add ( last , pos ) last = pos NEW_LINE


import java . util . * ; import java . io . * ;   public class one {   public static void main ( String [ ] args ) throws IOException , FileNotFoundException { BufferedReader in = new BufferedReader ( new InputStreamReader ( System . in ) ) ;


import java . util . * ; import java . io . * ; import java . math . * ;   public class Main {   final static int mod = 1000000007 ; static FastReader sc ; static PrintWriter out ; static boolean test_case_input = false ;   public static void solution ( ) throws IOException { long n = sc . nextLong ( ) ; long l = sc . nextLong ( ) ; long r = sc . nextLong ( ) ;   int len = Long . toBinaryString ( n ) . length ( ) ; if ( n == 1 ) len = 1 ;

def cz ( m ) : global ws , n if ( m % 2 == 1 ) : return 1 else : s = 2 i = 1 while ( m % ( s * 2 ) == 0 ) : s *= 2 i += 1 i = ws - i NEW_LINE


import sys , math   def func ( n , m , q ) : if m == 1 : return 1 x = m // 2 if x + 1 == q : return n % 2 else : if q > x + 1 : q -= ( x + 1 ) return func ( n // 2 , m // 2 , q )     def main ( ) :   n , l , r = map ( int , sys . stdin . readline ( ) . strip ( ) . split ( ) )   count = 0   if n >= 1 : m = 2 ** ( int ( math . log ( n , 2 ) ) + 1 ) - 1 for i in range ( l , r + 1 ) : if func ( n , m , i ) == 1 : count += 1   sys . stdout . write ( str ( count ) + ' \n ' )     main ( ) NEW_LINE


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 java . io . * ; import java . util . * ; import static java . lang . Math . * ;   public class CodeFor1 { public static void main ( String [ ] args ) throws IOException {


import java . util . * ; import java . io . * ; import java . math . * ;   public class Main {   private static int MAX = Integer . MAX_VALUE ; private static int MIN = Integer . MIN_VALUE ; private static int MOD = 1000000007 ; static FastScanner sc = new FastScanner ( ) ;   public static void main ( String [ ] args ) throws IOException {


import java . util . Scanner ;   public class Main { static int [ ] hash = new int [ 100 ] ; public static void main ( String [ ] args ) { Scanner in = new Scanner ( System . in ) ; int n = in . nextInt ( ) ; in . nextLine ( ) ; String s = in . nextLine ( ) ; char [ ] a = s . toCharArray ( ) ; int ans = 0 ; for ( int i = 0 ; i < s . length ( ) ; i ++ ) { if ( a [ i ] >= ' a ' && a [ i ] <= ' z ' ) { hash [ a [ i ] - ' a ' ] ++ ; } else { if ( hash [ a [ i ] - ' A ' ] > 0 ) { hash [ a [ i ] - ' A ' ] -- ; } else { ans ++ ; } } } System . out . println ( ans ) ; }   }

from collections import defaultdictd = defaultdict ( int ) n = int ( input ( ) ) s = input ( ) . strip ( ) s1 = [ ] s2 = [ ] for i in range ( 65 , 91 ) : s1 . append ( chr ( i ) ) for i in range ( 97 , 123 ) : s2 . append ( chr ( i ) ) res = 0 for i in range ( 0 , len ( s ) , 2 ) : if ( ord ( s [ i ] ) - ord ( ' a ' ) == ord ( s [ i + 1 ] ) - ord ( ' A ' ) ) or ( ord ( s [ i ] ) - ord ( ' A ' ) == ord ( s [ i + 1 ] ) - ord ( ' a ' ) ) : continue elif s [ i + 1 ] in s1 and d [ s2 [ ord ( s [ i + 1 ] ) - ord ( ' A ' ) ] ] != 0 : d [ s2 [ ord ( s [ i + 1 ] ) - ord ( ' A ' ) ] ] -= 1 d [ s [ i ] ] += 1 continue elif s [ i + 1 ] in s2 and d [ s1 [ ord ( s [ i + 1 ] ) - ord ( ' a ' ) ] ] != 0 : d [ s1 [ ord ( s [ i + 1 ] ) - ord ( ' a ' ) ] ] -= 1 d [ s [ i ] ] += 1 continue else : res += 1 d [ s [ i ] ] += 1 print ( res ) NEW_LINE


n = int ( input ( ) ) KD = input ( )   current_keys = { chr ( ord ( ' a ' ) + key ) : 0 for key in range ( 26 ) } keysToBuy = 0   for i in range ( n - 1 ) : door = KD [ i * 2 + 1 ] key = KD [ i * 2 ] current_keys [ key ] += 1 req_key = door . lower ( )   if current_keys [ req_key ] > 0 : current_keys [ req_key ] -= 1 else : keysToBuy += 1   print ( keysToBuy )   NEW_LINE


from collections import defaultdict   t = 1   for _ in range ( t ) : n = input ( ) s = input ( ) keys = defaultdict ( int ) ans = 0 for i in s : if i . islower ( ) : keys [ i ] += 1 else : if keys [ i . lower ( ) ] > 0 : keys [ i . lower ( ) ] -= 1 else : ans += 1 print ( ans ) NEW_LINE


import java . io . * ; import java . util . * ; import java . text . * ; import java . math . * ;   public class Solution {   public static void main ( String [ ] args ) throws IOException { BufferedReader br = new BufferedReader ( new InputStreamReader ( System . in ) ) ; HashMap < Character , Integer > m = new HashMap < Character , Integer > ( ) ; int n = Integer . parseInt ( br . readLine ( ) ) ; String s = br . readLine ( ) . trim ( ) ; int l = s . length ( ) ; int count = 0 ;


import java . io . * ; import java . util . * ; import java . text . * ; import java . math . * ;   public class Solution {   public static void main ( String [ ] args ) throws IOException { BufferedReader br = new BufferedReader ( new InputStreamReader ( System . in ) ) ; HashMap < Character , Integer > m = new HashMap < Character , Integer > ( ) ; int n = Integer . parseInt ( br . readLine ( ) ) ; String s = br . readLine ( ) . trim ( ) ; int l = s . length ( ) ; int count = 0 ; int ar [ ] = new int [ 26 ] ; for ( char ch : s . toCharArray ( ) ) { if ( ch >= 97 ) { ar [ ch - 97 ] ++ ; } else if ( ch < 97 && ar [ ch - 65 ] > 0 ) { ar [ ch - 65 ] -- ; } else { count ++ ; } }


import java . io . BufferedReader ; import java . io . FileNotFoundException ; import java . io . FileReader ; import java . io . IOException ; import java . io . InputStream ; import java . io . InputStreamReader ; import java . io . PrintWriter ; import java . util . * ; public class Main { public static void main ( String [ ] args ) throws IOException , InterruptedException { PrintWriter pw = new PrintWriter ( System . out ) ; Scanner sc = new Scanner ( System . in ) ; HashMap < Character , Integer > hm = new HashMap < > ( ) ; int n = sc . nextInt ( ) ; String s = sc . nextLine ( ) ; s = s . toLowerCase ( ) ; int c = 0 ; for ( int i = 0 ; i < s . length ( ) ; i += 2 ) { if ( s . charAt ( i ) != s . charAt ( i + 1 ) ) { if ( hm . containsKey ( s . charAt ( i + 1 ) ) && hm . get ( s . charAt ( i + 1 ) ) > 0 ) { hm . replace ( s . charAt ( i + 1 ) , hm . get ( s . charAt ( i + 1 ) ) - 1 ) ; } else {


import java . util . Scanner ;   public class B257 {   public static void main ( String [ ] args ) { Scanner in = new Scanner ( System . in ) ; int N = in . nextInt ( ) ; int M = in . nextInt ( ) ; int score1 = solve ( N - 1 , M , 0 , false ) ; int score2 = solve ( N , M - 1 , 1 , false ) ; int score = Math . max ( score1 , score2 ) ; System . out . println ( score + " ▁ " + ( N + M - 1 - score ) ) ; }   static int solve ( int N , int M , int last , boolean petya ) { int next ; if ( N == 0 ) { if ( M == 0 ) { return 0 ; } else { next = 1 ; } } else { if ( M == 0 ) { next = 0 ; } else { if ( petya ) { next = last ; } else { next = 1 - last ; } } } if ( next == 0 ) { N -- ; } else { M -- ; } int diff = ( last == next ) ? 1 : 0 ; return diff + solve ( N , M , next , ! petya ) ; } }

a , b = map ( int , input ( ) . split ( ) ) print ( max ( a , b ) - 1 , min ( a , b ) ) NEW_LINE


n , m = map ( int , input ( ) . split ( ) ) print ( ( n + m ) - 1 - min ( n , m ) , min ( n , m ) ) NEW_LINE


red , blue = map ( int , input ( ) . split ( ) ) total_point = red + blue - 1 vasya = min ( red , blue ) petya = total_point - vasyaprint ( petya , vasya ) NEW_LINE


n , m = map ( int , input ( ) . split ( ) ) print ( n + m - min ( n , m ) - 1 , min ( n , m ) ) NEW_LINE


n , m = list ( map ( int , input ( ) . split ( ) ) ) petaya = 0 NEW_LINE


import java . util . * ; import java . io . * ; import java . math . * ;   public class First {   public static void process ( ) throws IOException { int n = ni ( ) ; int m = ni ( ) ; pn ( ( Math . max ( n , m ) - 1 ) + " ▁ " + Math . min ( m , n ) ) ; }   static AnotherReader sc ; static PrintWriter out ; public static void main ( String [ ] args ) throws IOException { out = new PrintWriter ( System . out ) ; sc = new AnotherReader ( ) ; boolean oj = true ;


import java . util . * ; import java . math . * ; import java . lang . * ; import javafx . util . Pair ;   public class gfg { public static void main ( String args [ ] ) { Scanner sc = new Scanner ( System . in ) ; int n = sc . nextInt ( ) ; int m = sc . nextInt ( ) ; int max = Math . max ( n , m ) ; int min = Math . min ( n , m ) ; System . out . println ( max - 1 + " ▁ " + min ) ; } }


import java . util . Scanner ;   public class PlayingCubes { public static void main ( String [ ] args ) { Scanner sc = new Scanner ( System . in ) ; int n = sc . nextInt ( ) ; int m = sc . nextInt ( ) ; int min = Math . min ( n , m ) ; int max = Math . max ( n , m ) ;   System . out . println ( ( max - 1 ) + " ▁ " + ( min ) ) ; }   }


import java . util . * ; import java . lang . * ; import java . io . * ; public class Main { PrintWriter out ; FastReader sc ; long mod = ( long ) ( 1e9 + 7 ) ; long maxlong = Long . MAX_VALUE ; long minlong = Long . MIN_VALUE ; public void sol ( ) { int n = ni ( ) ; PriorityQueue < Integer > pq = new PriorityQueue < > ( new Comparator < Integer > ( ) { public int compare ( Integer a , Integer b ) { return Integer . compare ( b , a ) ; } } ) ; for ( int i = 0 ; i < n ; i ++ ) { int p = ni ( ) ; if ( p % 2 == 0 ) pq . add ( p ) ; } int ans = 0 ; while ( pq . size ( ) > 0 ) { int p = pq . poll ( ) / 2 ;

I = lambda : map ( int , input ( ) . split ( ) ) INT = lambda : int ( input ( ) )   T = INT ( ) NEW_LINE


from math import * import sysinput = sys . stdin . readlinea = int ( input ( ) ) for x in range ( a ) : b = int ( input ( ) ) c = list ( map ( int , input ( ) . split ( ) ) ) j = list ( set ( c ) ) n = 0 d = { } for z in range ( len ( j ) ) : if j [ z ] & 1 == 0 : d [ j [ z ] ] = 1   j . sort ( ) for y in range ( len ( j ) ) : if j [ y ] & 1 == 0 : j [ y ] = int ( j [ y ] / 2 ) n += 1 while ( j [ y ] & 1 == 0 and d . get ( j [ y ] ) == None ) : d [ j [ y ] ] = 1 j [ y ] = int ( j [ y ] / 2 ) n += 1   print ( n ) NEW_LINE


for _ in range ( int ( input ( ) ) ) : n = int ( input ( ) ) a = list ( map ( int , input ( ) . split ( ) ) ) b = list ( set ( a ) ) d = { } c = 0 for i in range ( len ( b ) ) : if ( b [ i ] & 1 == 0 ) : d [ b [ i ] ] = 1 b . sort ( reverse = True ) for i in range ( len ( b ) ) : if b [ i ] & 1 == 0 : b [ i ] = b [ i ] // 2 c += 1 while ( b [ i ] & 1 == 0 and d . get ( b [ i ] ) == None ) : d [ b [ i ] ] = 1 b [ i ] = b [ i ] // 2 c += 1 print ( c ) NEW_LINE


for _ in range ( int ( input ( ) ) ) : input ( ) l = list ( map ( int , input ( ) . split ( ) ) ) s = set ( ) for x in l : while x % 2 == 0 and x not in s : s . add ( x ) x //= 2 print ( len ( s ) ) NEW_LINE


import java . awt . Desktop ;    import java . io . BufferedReader ;    import java . io . IOException ; import java . io . InputStreamReader ; import java . io . PrintWriter ; import java . net . URI ; import java . net . URISyntaxException ; import java . sql . Array ; import java . util . ArrayList ; import java . util . Arrays ; import java . util . Collections ; import java . util . Comparator ; import java . util . HashMap ; import java . util . HashSet ; import java . util . Iterator ; import java . util . LinkedHashMap ; import java . util . LinkedHashSet ; import java . util . LinkedList ; import java . util . List ; import java . util . Map ; import java . util . PriorityQueue ; import java . util . Queue ; import java . util . Scanner ; import java . util . Set ; import java . util . Stack ; import java . util . StringTokenizer ; import java . util . TreeSet ; import java . util . Vector ;     public class codechef3 { static class comp implements Comparator < Integer > {   @ Override public int compare ( Integer o1 , Integer o2 ) { if ( Math . abs ( o1 ) > Math . abs ( o2 ) ) return - 1 ; else return 1 ; } }


import java . io . * ; import java . util . * ; public class Solution { public static void main ( String [ ] args ) throws Exception { FastReader fr = new FastReader ( ) ; int t = fr . nextInt ( ) ; while ( t -- > 0 ) { int n = fr . nextInt ( ) ; int a [ ] = new int [ n ] ; Set < Integer > set = new HashSet < > ( ) ; for ( int i = 0 ; i < n ; i ++ ) { a [ i ] = fr . nextInt ( ) ; if ( a [ i ] % 2 == 0 ) set . add ( a [ i ] ) ; } Arrays . sort ( a ) ;