import java . util . * ;   public class P3 { public static void main ( String [ ] args ) { Scanner sc = new Scanner ( System . in ) ; int k = sc . nextInt ( ) ; int n = sc . nextInt ( ) ; int s = sc . nextInt ( ) ; int p = sc . nextInt ( ) ; int r = 0 ; if ( n <= s ) { if ( k % p == 0 ) { r = k / p ; } else { r = ( k / p ) + 1 ; } } else {   int d = 0 ; if ( n % s == 0 ) {   d = n / s ; } else { d = ( n / s ) + 1 ; } if ( ( k * d ) % p == 0 ) { r = ( k * d ) / p ; } else { r = ( k * d ) / p + 1 ; } } System . out . println ( r ) ; } }


k , n , s , p = map ( int , input ( ) . split ( ) ) x = ( n + s - 1 ) // sx *= kprint ( ( x + p - 1 ) // p )     NEW_LINE


k , n , s , p = map ( int , input ( ) . split ( ' ▁ ' ) ) if ( 1 * n ) % s == 0 : need = ( 1 * n ) // s if need == 0 and k % p == 0 : print ( k // p ) elif ( k * need ) % p == 0 : print ( ( k * need ) // p ) else : print ( ( ( k * need ) // p ) + 1 ) else : need = ( ( 1 * n ) // s ) + 1 if need == 0 and k % p == 0 : print ( k // p ) elif ( k * need ) % p == 0 : print ( ( k * need ) // p ) else : print ( ( ( k * need ) // p ) + 1 ) NEW_LINE


k , n , s , p = map ( int , input ( ) . split ( ) )   paper_person = ( n + s - 1 ) // s   total_needed = paper_person * k   ans = ( total_needed + p - 1 ) // p   print ( ans )     NEW_LINE


import mathk , n , s , p = map ( int , input ( ) . split ( ) ) sheets = math . ceil ( n / s ) * kprint ( math . ceil ( sheets / p ) ) NEW_LINE


import java . util . * ; public class Solution { public static void main ( String [ ] args ) { Scanner sc = new Scanner ( System . in ) ; int t = sc . nextInt ( ) ; for ( int i = 0 ; i < t ; i ++ ) { int a = sc . nextInt ( ) ; int b = sc . nextInt ( ) ; int c = Math . abs ( a - b ) ; if ( c % 10 == 0 ) { System . out . println ( c / 10 ) ; } else { System . out . println ( ( c / 10 ) + 1 ) ; } }   } }

if __name__ == ' _ _ main _ _ ' :     NEW_LINE t = int ( input ( ) ) NEW_LINE result = [ ] NEW_LINE for _ in range ( t ) : c = input ( ) . split ( ) NEW_LINE a , b = int ( c [ 0 ] ) , int ( c [ 1 ] ) NEW_LINE if a > b : NEW_LINE INDENT difference = a - b else : NEW_LINE difference = b - a   dif = difference // 10 NEW_LINE DEDENT mod = 1 if difference % 10 else 0 NEW_LINE print ( dif + mod )   """ 65 ▁ 513 ▁ 4218 ▁ 41337 ▁ 420123456789 ▁ 1000000000100500 ▁ 9000  """ NEW_LINE


for x in range ( int ( input ( ) ) ) : a , b = map ( int , input ( ) . split ( ) ) NEW_LINE c = abs ( a - b ) NEW_LINE if c % 10 == 0 : NEW_LINE INDENT print ( c // 10 ) else : NEW_LINE print ( ( c // 10 ) + 1 ) NEW_LINE DEDENT


from math import ceilt = int ( input ( ) ) NEW_LINE for i in range ( t ) : a , b = map ( int , input ( ) . split ( ) ) NEW_LINE print ( ceil ( ( abs ( a - b ) / 10 ) ) ) NEW_LINE


for _ in range ( int ( input ( ) ) ) : a , b = map ( int , input ( ) . split ( " ▁ " ) ) NEW_LINE count = 0 NEW_LINE if a != b : if NEW_LINE a < b : count = ( ( b - a ) // 10 ) NEW_LINE a += 10 * ( ( b - a ) // 10 ) NEW_LINE if b - a : NEW_LINE INDENT count += 1 else : NEW_LINE count += ( ( a - b ) // 10 ) NEW_LINE DEDENT a -= 10 * ( ( a - b ) // 10 ) NEW_LINE if a - b : count += 1 NEW_LINE print ( count ) NEW_LINE


cases = int ( input ( ) ) NEW_LINE for i in range ( cases ) : a , b = map ( int , input ( ) . split ( ) ) NEW_LINE temp = abs ( a - b ) NEW_LINE count = 0 NEW_LINE if temp == 0 : NEW_LINE INDENT print ( 0 ) else : NEW_LINE count = temp // 10 NEW_LINE DEDENT temp = temp - 10 * count NEW_LINE if temp % 10 != 0 : count += 1   print ( count ) NEW_LINE


import java . util . * ; public class Solutions { public static void main ( String [ ] args ) { Scanner s = new Scanner ( System . in ) ; int t = s . nextInt ( ) ; while ( t -- > 0 ) { int a = s . nextInt ( ) ; int b = s . nextInt ( ) ; int diff = Math . abs ( a - b ) ; int sum = 10 ; int step = 0 ; while ( diff != 0 ) { if ( diff >= sum ) { int p = diff / sum ; diff = diff - p * sum ; step += p ; } else { sum -- ; } } System . out . println ( step ) ; } } }


import java . util . Scanner ;   public class Main {   public static void main ( String [ ] args ) { Scanner in = new Scanner ( System . in ) ; int t = in . nextInt ( ) ; while ( t > 0 ) { t -- ; long a = in . nextLong ( ) ; long b = in . nextLong ( ) ; long difference ; long x ; if ( a == b ) System . out . println ( 0 ) ; else { difference = Math . abs ( b - a ) ; x = difference / 10 ; if ( difference % 10 == 0 ) System . out . println ( x ) ; else System . out . println ( x + 1 ) ; }   }   }


import java . util . Scanner ;   public class yet_another_two_integer_problem {   public static void main ( String [ ] args ) { Scanner in = new Scanner ( System . in ) ;   int t = in . nextInt ( ) ; int a , b ; while ( t -- != 0 ) { a = in . nextInt ( ) ; b = in . nextInt ( ) ; System . out . println ( ( int ) Math . ceil ( ( Math . abs ( a - b ) / 10.0 ) ) ) ;   } }   }


import java . util . Scanner ;   public class A { public static void main ( String [ ] args ) { Scanner sc = new Scanner ( System . in ) ; int t = sc . nextInt ( ) ; while ( t -- > 0 ) { int a = sc . nextInt ( ) ; int b = sc . nextInt ( ) ; int s = Math . abs ( a - b ) ; int ans = s / 10 ; if ( s % 10 != 0 ) ans ++ ; System . out . println ( ans ) ; }   } }


import java . util . Scanner ;   public class BrainsPhotos { public static void main ( String [ ] args ) { Scanner scan = new Scanner ( System . in ) ; int n = scan . nextInt ( ) ; int m = scan . nextInt ( ) ; boolean a = true ; for ( int i = 0 ; i <= n ; i ++ ) { String s = scan . nextLine ( ) ; for ( int j = 0 ; j < s . length ( ) ; j ++ ) { if ( s . charAt ( j ) == ' ▁ ' ) { continue ; } if ( s . charAt ( j ) == ' Y ' || s . charAt ( j ) == ' M ' || s . charAt ( j ) == ' C ' ) { a = false ; } } } if ( a == false ) { System . out . println ( " # Color " ) ; } else { System . out . println ( " # Black & White " ) ; } scan . close ( ) ; } }

p , s = map ( int , input ( ) . split ( ) ) c = 0 for i in range ( p ) : h = list ( map ( str , input ( ) . split ( ) ) ) if ( ( " C " in h ) or ( " M " in h ) or ( " Y " in h ) ) : c = 1 if ( c == 1 ) : print ( " # Color " ) elif ( c == 0 ) : print ( " # Black & White " ) NEW_LINE


n , m = map ( int , input ( ) . split ( ) ) s = ' ' for i in range ( n ) : s += input ( ) if ' C ' in s or ' M ' in s or ' Y ' in s : print ( ' # Color ' ) else : print ( ' # Black & White ' ) NEW_LINE


n , m = map ( int , input ( ) . split ( ) ) s = 0 for i in range ( n ) : a = [ i for i in input ( ) . split ( ) ] s += a . count ( ' W ' ) + a . count ( ' B ' ) + a . count ( ' G ' ) if s == n * m : print ( ' # Black & White ' ) else : print ( ' # Color ' ) NEW_LINE


a , b = map ( int , input ( ) . split ( ) ) for i in range ( a ) : curStr = input ( ) if ' C ' in curStr or ' M ' in curStr or ' Y ' in curStr : print ( " # Color " ) breakelse : print ( " # Black & White " ) NEW_LINE


n , m = map ( int , input ( ) . split ( ) ) z = 0 for i in range ( n ) : l = input ( ) . split ( ) if ( ' C ' in l or ' M ' in l or ' Y ' in l ) : z = 1 break   if ( z == 0 ) : print ( " # Black & White " ) else : print ( " # Color " ) NEW_LINE


import java . io . BufferedReader ; import java . io . IOException ; import java . io . InputStreamReader ; import java . util . StringTokenizer ;   public class Brains_Photos { static class RealScanner { 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 ( ) ) ; } }   public static void main ( String [ ] args ) { RealScanner sc = new RealScanner ( ) ; int m , n ; m = sc . nextInt ( ) ; n = sc . nextInt ( ) ; String [ ] [ ] s = new String [ m ] [ n ] ; for ( int i = 0 ; i < m ; i ++ ) { for ( int j = 0 ; j < n ; j ++ ) { s [ i ] [ j ] = sc . next ( ) ; } } int count = 0 ; boolean check = true ; for ( int i = 0 ; i < m ; i ++ ) { for ( int j = 0 ; j < n ; j ++ ) { if ( s [ i ] [ j ] . equals ( " B " ) || s [ i ] [ j ] . equals ( " W " ) || s [ i ] [ j ] . equals ( " G " ) ) {   } else { count ++ ; check = false ; } } } if ( count < 3 && check ) { System . out . println ( " # Black & White " ) ; } else { System . out . println ( " # Color " ) ; } } }


import java . util . * ; public class Main { public static void main ( String [ ] args ) { Scanner sc = new Scanner ( System . in ) ; int a = sc . nextInt ( ) * sc . nextInt ( ) ; while ( a -- > 0 ) { String x = sc . next ( ) ; if ( ! ( x . equals ( " B " ) | x . equals ( " G " ) | x . equals ( " W " ) ) ) { System . out . println ( " # Color " ) ; return ; } } System . out . println ( " # Black & White " ) ; } }


import java . util . Scanner ;   public class Brains_Photos {   static Scanner sc = new Scanner ( System . in ) ;   public static void main ( String [ ] args ) { int number = sc . nextInt ( ) + 1 ; int temp = sc . nextInt ( ) ; String s = " " ; String c = " C " , m = " M " , y = " Y " ; while ( number > 0 ) { s = s + sc . nextLine ( ) ; number -- ; } if ( s . contains ( c ) || s . contains ( m ) || s . contains ( y ) ) { System . out . println ( " # Color " ) ; } else { System . out . println ( " # Black & White " ) ; } } }


import java . io . BufferedReader ; import java . io . InputStreamReader ; import java . util . * ;   public class Main {   public static void main ( String [ ] args ) { Scanner sc = new Scanner ( new BufferedReader ( new InputStreamReader ( System . in ) ) ) ; int n = sc . nextInt ( ) ; int m = sc . nextInt ( ) ;   for ( int i = 0 ; i < n * m ; i ++ ) { String s = sc . next ( ) ; if ( s . equalsIgnoreCase ( " C " ) || s . equalsIgnoreCase ( " M " ) || s . equalsIgnoreCase ( " Y " ) ) { System . out . println ( " # Color " ) ; return ; } }   System . out . println ( " # Black & White " ) ; } }


import java . io . OutputStream ; import java . io . IOException ; import java . io . InputStream ; import java . io . PrintWriter ; import java . util . * ; import java . io . IOException ; import java . io . BufferedReader ; import java . io . InputStreamReader ; import java . io . InputStream ;   public class Two {   public static void main ( String [ ] args ) { InputStream inputStream = System . in ; OutputStream outputStream = System . out ; InputReader in = new InputReader ( inputStream ) ; PrintWriter out = new PrintWriter ( outputStream ) ; TaskA solver = new TaskA ( ) ; int t ;

from copy import copy   a = list ( map ( int , input ( ) . split ( ) ) )   ans = 0 for i in range ( 14 ) : b = copy ( a ) b [ i ] = 0   for j in range ( 1 , 14 + 1 ) : b [ ( i + j ) % 14 ] += ( a [ i ] - 1 ) // 14 + ( ( a [ i ] - 1 ) % 14 + 1 > j - 1 )   ans = max ( ans , sum ( el * ( el % 2 == 0 ) for el in b ) )   print ( ans ) NEW_LINE


if __name__ == ' _ _ main _ _ ' : a = [ int ( i ) for i in input ( ) . split ( ) ]   mx = - 1   for i in range ( 14 ) : b = a . copy ( ) if a [ i ] : b [ i ] , d , ans = 0 , i + 1 , 0 r = ( a [ i ] + d ) // 14 l = ( a [ i ] + d ) % 14   if d + a [ i ] < 14 : ans = sum ( [ j + 1 for j in a [ d : d + a [ i ] ] if not ( j + 1 ) % 2 ] ) else : for j in range ( 14 ) : b [ j ] += r if d > l : for j in range ( l , d ) : b [ j ] -= 1 else : for j in range ( d , d + abs ( d - l ) ) : b [ j ] += 1 ans = sum ( [ p for p in b if not p % 2 ] ) mx = max ( mx , ans )   print ( mx ) NEW_LINE


A = list ( map ( int , input ( ) . split ( ) ) )   ans = 0 for i in range ( 14 ) : if A [ i ] == 0 : continue B = A + A B [ i + 14 ] = 0 q , r = divmod ( B [ i ] , 14 ) for j in range ( 1 , 15 ) : if j <= r : B [ i + j ] += ( q + 1 ) else : B [ i + j ] += q NEW_LINE


a = list ( map ( int , input ( ) . split ( ) ) ) n = len ( a ) k = [ i for i in a ] lst = [ ] for i in range ( n ) : p = k [ i ] % n ans = 0 a = k [ i + 1 : ] + k [ : i + 1 ] a [ - 1 ] = 0 for j in range ( n ) : if ( a [ j ] + 1 + int ( k [ i ] // n ) ) % 2 == 0 and j < p : ans += a [ j ] + 1 + int ( k [ i ] // n ) elif ( a [ j ] + int ( k [ i ] // n ) ) % 2 == 0 and j >= p : ans += a [ j ] + int ( k [ i ] // n ) lst . append ( ans )   print ( max ( lst ) ) NEW_LINE


import java . io . * ; import java . util . * ;   public class Solution { public static void main ( String [ ] args ) throws Exception { long [ ] A = in . readLA ( ) ; long max = 0 ; for ( int i = 0 ; i < A . length ; i ++ ) { long cur = 0 , add = A [ i ] / 14 , nz = A [ i ] % 14 ;


import java . util . Scanner ;   public class B975 {   public static void main ( String [ ] args ) { Scanner in = new Scanner ( System . in ) ; int [ ] A = new int [ 14 ] ; for ( int i = 0 ; i < 14 ; i ++ ) { A [ i ] = in . nextInt ( ) ; } long max = 0 ; for ( int from = 0 ; from < 14 ; from ++ ) { int a = A [ from ] ; int remains = a / 14 ; long score = ( remains % 2 == 0 ) ? remains : 0 ; for ( int i = 1 ; i < 14 ; i ++ ) { int count = A [ ( from + i ) % 14 ] + ( a + 14 - i ) / 14 ; if ( count % 2 == 0 ) { score += count ; } } max = Math . max ( max , score ) ; } System . out . println ( max ) ; }   }


import java . util . * ;   public class ICPC { public static void main ( String [ ] args ) { Scanner sc = new Scanner ( System . in ) ; int n = sc . nextInt ( ) ; boolean ar [ ] = new boolean [ 5000 + 1 ] ; for ( int i = 0 ; i < n ; i ++ ) { ar [ sc . nextInt ( ) ] = true ;   } int c = 0 ; for ( int i = 1 ; i <= n ; i ++ ) { if ( ! ar [ i ] ) { c ++ ; }   } System . out . println ( c ) ;   }        public List < Integer > getDivisors ( int n ) { List < Integer > list = new ArrayList < > ( ) ; for ( int d = 2 ; d * d <= n ; d ++ ) { while ( n % d == 0 ) { list . add ( d ) ; n /= d ; } } if ( n > 1 ) { list . add ( n ) ; } return list ; }   public int gcd ( int n1 , int n2 ) { int gcd = 1 ; for ( int i = 1 ; i <= n1 && i <= n2 ; ++ i ) {

n = int ( input ( ) ) arr = [ int ( x ) for x in input ( ) . split ( ) ] s = 0 for i in range ( 1 , n + 1 ) : if i not in arr : s += 1 print ( s ) NEW_LINE


n = int ( input ( ) ) arr = list ( map ( int , input ( ) . split ( ) ) ) values = [ 0 ] * nc = 0 for i in range ( n ) : if ( arr [ i ] > n ) : c += 1 else : values [ arr [ i ] - 1 ] += 1 if ( values [ arr [ i ] - 1 ] > 1 ) : c += 1 print ( c ) NEW_LINE


n = int ( input ( ) )   seq = [ int ( i ) for i in input ( ) . split ( ) ]   l_n = [ i for i in seq if i <= n ] ans = n - len ( set ( l_n ) )   print ( ans ) NEW_LINE


a = int ( input ( ) ) b = list ( map ( int , input ( ) . split ( ) ) ) d = { } for x in range ( a ) : if d . get ( b [ x ] ) == None : d [ b [ x ] ] = 1 else : d [ b [ x ] ] += 1   h = 0 for x in d : if x > a : h += d [ x ] else : h += d [ x ] - 1   print ( h )   NEW_LINE


n = int ( input ( ) ) l = list ( map ( int , input ( ) . split ( ) ) ) s = set ( l ) c = 0 for i in s : if ( ( i > n ) or ( i < 0 ) ) : c = c + 1 c = c + ( n - ( len ( s ) ) ) print ( c ) NEW_LINE


import java . math . BigInteger ; import java . util . * ;   public class Example { 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 ( ) ;   } int ans = 0 ; for ( int i = 1 ; i <= n ; i ++ ) { boolean tt = false ; for ( int j = 0 ; j < n ; j ++ ) { if ( i == a [ j ] ) { tt = true ; break ; } } if ( ! tt ) ans ++ ; } System . out . println ( ans ) ; } }


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


import java . util . * ; import java . io . * ; import java . math . * ;   public class Task {

def nck ( n , k ) : if ( n < k ) : return 0 num = 1 den = 1 if ( k > n - k ) : return nck ( n , n - k ) for i in range ( k ) : num = num * ( n - i ) den = den * ( i + 1 ) return num // denl = input ( ) . split ( ) n = int ( l [ 0 ] ) m = int ( l [ 1 ] ) h = int ( l [ 2 ] ) l = input ( ) . split ( ) li = [ int ( i ) for i in l ] poss = sum ( li ) - 1 if ( poss < n - 1 ) : print ( - 1 ) else : ki = li [ h - 1 ] - 1 print ( 1 - ( nck ( poss - ki , n - 1 ) / nck ( poss , n - 1 ) ) ) NEW_LINE


def nCk ( n , k ) : res = 1 for i in range ( 1 , k + 1 ) : res = res * ( n - i + 1 ) // i return res     n , _ , me = map ( int , input ( ) . split ( ) ) a = [ 0 ] + list ( map ( int , input ( ) . split ( ) ) )   s = sum ( a ) if n > s : print ( - 1 ) exit ( )   allWays = nCk ( s - 1 , n - 1 ) aa = nCk ( s - a [ me ] , n - 1 ) print ( 1 - aa / allWays ) NEW_LINE


from math import combif __name__ == ' _ _ main _ _ ' : n , m , h = map ( int , input ( ) . split ( ) ) h -= 1   arr = [ int ( i ) for i in input ( ) . split ( ) ] arr [ h ] -= 1 n -= 1   total = sum ( arr ) if total < n : print ( - 1 ) exit ( 0 ) ans = comb ( total - arr [ h ] , n ) / comb ( total , n ) print ( 1 - ans ) NEW_LINE


import java . io . BufferedReader ; import java . io . FileReader ; import java . io . IOException ; import java . io . InputStreamReader ; import java . util . Scanner ; import java . util . StringTokenizer ; import java . util . * ; import java . io . * ; public class codeforces { static class Student { int x , y ; Student ( int x , int y ) { this . x = x ; this . y = y ;


import java . io . * ; import java . util . * ; public class Main {   public static final int mod = 1000000007 ; static long [ ] [ ] dp ; public static void main ( String [ ] args ) throws IOException {


import java . util . * ; public class asd { static Scanner s = new Scanner ( System . in ) ; public static void main ( String args [ ] ) { int t = 1 ; while ( t -- > 0 ) { solve ( ) ; } } public static void solve ( ) { int a = s . nextInt ( ) ; int b = s . nextInt ( ) ; int c = s . nextInt ( ) ; if ( 2 * c > ( Math . min ( a , b ) ) ) System . out . println ( " Second " ) ; else System . out . println ( " First " ) ;   } }

a , b , r = map ( int , input ( ) . split ( ) ) d = r + rk = a // dp = b // d   if ( k > 0 and p > 0 ) : print ( " First " ) else : print ( " Second " ) NEW_LINE


a , b , r = map ( int , input ( ) . split ( ) ) Sc = 3.14 * ( r ** 2 ) Ss = a * bp = " First " if a < r * 2 or b < r * 2 : print ( " Second " ) else : print ( " First " ) NEW_LINE


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


a , b , r = map ( int , input ( ) . split ( ) ) if ( 2 * r > min ( a , b ) ) : print ( " Second " ) else : print ( " First " ) NEW_LINE


import java . util . Scanner ;   public class TestBetter { public static void main ( String [ ] args ) { Scanner input = new Scanner ( System . in ) ; int a , b , r ; a = input . nextInt ( ) ; b = input . nextInt ( ) ; r = input . nextInt ( ) ;   System . out . println ( ( ( ( 2 * r ) <= a ) && ( ( 2 * r ) <= b ) ) ? " First " : " Second " ) ; } }


import java . io . * ; import java . util . * ;    public class PlateGame {   public static void main ( String args [ ] ) { FastReader sc = new FastReader ( ) ; PrintWriter out = new PrintWriter ( System . out ) ;   int a , b , r , i , j ; String s ;   a = sc . nextInt ( ) ; b = sc . nextInt ( ) ; r = sc . nextInt ( ) ; if ( 2 * r <= a && 2 * r <= b ) out . println ( " First " ) ; else out . println ( " Second " ) ;   out . close ( ) ; }      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 ; } int [ ] readArray ( int n ) { int arr [ ] = new int [ n ] ; for ( int i = 0 ; i < n ; i ++ ) arr [ i ] = nextInt ( ) ; return arr ; } } }


import java . util . * ; import java . io . * ; import java . math . * ;   public class x197A { public static void main ( String hi [ ] ) throws Exception { BufferedReader infile = new BufferedReader ( new InputStreamReader ( System . in ) ) ; StringTokenizer st = new StringTokenizer ( infile . readLine ( ) ) ; int A = Integer . parseInt ( st . nextToken ( ) ) ; int B = Integer . parseInt ( st . nextToken ( ) ) ; int R = Integer . parseInt ( st . nextToken ( ) ) ;


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


import java . util . Scanner ;   public class ElectionSystem { public static void main ( String [ ] args ) { Scanner scanner = new Scanner ( System . in ) ;   int n = scanner . nextInt ( ) ; int m = scanner . nextInt ( ) ;   int [ ] candidate = new int [ n ] ;   for ( int i = 0 ; i < m ; i ++ ) { int max = 0 ; int maxVal = 0 ;   for ( int j = 0 ; j < n ; j ++ ) { int curr = scanner . nextInt ( ) ; if ( maxVal < curr ) { maxVal = curr ; max = j ; } }   candidate [ max ] ++ ; }   int max = 0 ; for ( int i = 0 ; i < n ; i ++ ) { if ( candidate [ max ] < candidate [ i ] ) max = i ; }   System . out . println ( max + 1 ) ; } }

n , m = map ( int , input ( ) . split ( ) )   wins = [ 0 ] * nfor _ in range ( m ) : t = list ( map ( int , input ( ) . split ( ) ) ) winner = 0 for x in range ( 1 , n ) : if t [ x ] > t [ winner ] : winner = x   wins [ winner ] += 1   winner = 0 for x in range ( 1 , n ) : if wins [ x ] > wins [ winner ] : winner = x   print ( winner + 1 ) NEW_LINE


def most_common ( lst ) : return max ( set ( lst ) , key = lst . count ) n , m = [ int ( x ) for x in input ( ) . split ( ) ] a = [ ] for i in range ( m ) : t = [ int ( x ) for x in input ( ) . split ( ) ] a . append ( t . index ( max ( t ) ) + 1 ) print ( most_common ( a ) ) NEW_LINE


n , m = [ int ( j ) for j in input ( ) . split ( ) ] mat = [ ] for j in range ( m ) : mat . append ( [ int ( j ) for j in input ( ) . split ( ) ] ) stream = n * [ 0 ] for j in range ( m ) : index = 0 for k in range ( 1 , n ) : if mat [ j ] [ k ] > mat [ j ] [ index ] : index = k stream [ index ] += 1 print ( stream . index ( max ( stream ) ) + 1 ) NEW_LINE


ad , cit = list ( map ( int , input ( ) . split ( ) ) ) d = { } for i in range ( cit ) : l = list ( map ( int , input ( ) . split ( ) ) ) maxi = l [ 0 ] ind = 1 for i in range ( len ( l ) ) : if l [ i ] > maxi : maxi = l [ i ] ind = i + 1 if not ind in d : d [ ind ] = 0 d [ ind ] += 1 maxi = - 1 for adam , say in d . items ( ) : if say > maxi : maxi = say qalib = adam elif say == maxi and qalib > adam : qalib = adamprint ( qalib ) NEW_LINE


if __name__ == ' _ _ main _ _ ' : Y = lambda : list ( map ( int , input ( ) . split ( ) ) ) P = lambda : map ( int , input ( ) . split ( ) )   n , m = P ( ) c = [ 0 ] * n   while m > 0 : a = Y ( ) c [ a . index ( max ( a ) ) ] += 1 m -= 1 print ( c . index ( max ( c ) ) + 1 ) NEW_LINE


import java . io . File ; import java . io . FileNotFoundException ; import java . io . IOException ; import java . io . PrintWriter ; import java . util . * ;   public class Main { public static void main ( String [ ] args ) { Scanner input = new Scanner ( System . in ) ; int n = input . nextInt ( ) ; int m = input . nextInt ( ) ; int ans [ ] = new int [ n ] ; for ( int i = 0 ; i < m ; i ++ ) { int max = Integer . MIN_VALUE ; int maxIndex = - 1 ; for ( int j = 0 ; j < n ; j ++ ) { int value = input . nextInt ( ) ; if ( value > max ) { max = value ; maxIndex = j ; } } ans [ maxIndex ] ++ ; } int max = Integer . MIN_VALUE ; int maxIndex = - 1 ; for ( int i = 0 ; i < n ; i ++ ) { if ( max < ans [ i ] ) { max = ans [ i ] ; maxIndex = i ; } } System . out . println ( maxIndex + 1 ) ;


import java . util . * ; import java . lang . * ;


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


import java . util . * ; import java . lang . * ; public class Main { public static void main ( String args [ ] ) { Scanner sc = new Scanner ( System . in ) ; int a = sc . nextInt ( ) ; for ( int i = 0 ; i < a ; i ++ ) { int x = sc . nextInt ( ) ; int y = sc . nextInt ( ) ; System . out . println ( x + y ) ; } } }

t = int ( input ( ) )   while t : a , b = map ( int , input ( ) . split ( ) ) print ( a + b ) t -= 1 NEW_LINE


t = int ( input ( ) )   while t > 0 : t -= 1 a , b = map ( int , input ( ) . split ( " ▁ " ) ) print ( a + b ) NEW_LINE


for t in range ( int ( input ( ) ) ) : a , b = map ( int , input ( ) . split ( ) ) print ( a + b ) NEW_LINE


t = int ( input ( ) ) for _ in range ( t ) : a , b = map ( int , input ( ) . split ( ) ) print ( a + b ) NEW_LINE


for _ in range ( int ( input ( ) ) ) : a , b = map ( int , input ( ) . split ( ) ) print ( a + b ) NEW_LINE


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 . Scanner ;   public class Task { public static void main ( String [ ] args ) { Scanner in = new Scanner ( System . in ) ; int t = in . nextInt ( ) ; while ( t -- > 0 ) { System . out . println ( in . nextInt ( ) + in . nextInt ( ) ) ; } } }


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 . StringTokenizer ; public class Main { static class FastScanner { BufferedReader br = new BufferedReader ( new InputStreamReader ( System . in ) ) ; StringTokenizer st = new StringTokenizer ( " " ) ;   String next ( ) { while ( ! st . hasMoreTokens ( ) ) try { st = new StringTokenizer ( br . readLine ( ) ) ; } catch ( IOException e ) { e . printStackTrace ( ) ; } return st . nextToken ( ) ; }   int nextInt ( ) { return Integer . parseInt ( next ( ) ) ; }   int [ ] nextArray ( int n ) { int [ ] a = new int [ n ] ; for ( int i = 0 ; i < n ; i ++ ) a [ i ] = nextInt ( ) ; return a ; } long [ ] nextArray ( long n ) { long [ ] a = new long [ ( int ) n ] ; for ( int i = 0 ; i < n ; i ++ ) a [ i ] = nextLong ( ) ; return a ; }   long nextLong ( ) { return Long . parseLong ( next ( ) ) ; } } static class FastWriter extends PrintWriter { FastWriter ( ) { super ( System . out ) ; } void println ( int [ ] array ) { for ( int i = 0 ; i < array . length ; i ++ ) { print ( array [ i ] + " ▁ " ) ; } println ( ) ; } void println ( long [ ] array ) { for ( int i = 0 ; i < array . length ; i ++ ) { print ( array [ i ] + " ▁ " ) ; } println ( ) ; } } public static void main ( String [ ] args ) { FastScanner in = new FastScanner ( ) ; FastWriter out = new FastWriter ( ) ; int t = in . nextInt ( ) ; outer : while ( t -- > 0 ) { int n = in . nextInt ( ) ; int m = in . nextInt ( ) ; out . println ( n + m ) ; } out . close ( ) ; } }


import java . util . Scanner ;   public class Main {   public static void main ( String [ ] args ) { Scanner in = new Scanner ( System . in ) ;   int n = in . nextInt ( ) ;   boolean [ ] levels = new boolean [ n ] ;   while ( in . hasNext ( ) ) { int p = in . nextInt ( ) ; for ( int i = 0 ; i < p ; i ++ ) { levels [ in . nextInt ( ) - 1 ] = true ; } }   for ( boolean level : levels ) { if ( ! level ) { System . out . println ( " Oh , ▁ my ▁ keyboard ! " ) ; return ; } }   System . out . println ( " I ▁ become ▁ the ▁ guy . " ) ;    } }

n = int ( input ( ) ) s = set ( list ( map ( int , input ( ) . split ( ) ) ) [ 1 : ] + list ( map ( int , input ( ) . split ( ) ) ) [ 1 : ] ) s . discard ( 0 ) if len ( s ) == n : print ( " I ▁ become ▁ the ▁ guy . " ) else : print ( " Oh , ▁ my ▁ keyboard ! " ) NEW_LINE


n = int ( input ( ) ) l = list ( map ( int , input ( ) . split ( ) ) ) m = list ( map ( int , input ( ) . split ( ) ) ) k = [ ] for i in range ( 1 , len ( l ) ) : k . append ( l [ i ] ) for i in range ( 1 , len ( m ) ) : k . append ( m [ i ] ) k = list ( set ( k ) ) if ( len ( k ) == n ) : print ( " I ▁ become ▁ the ▁ guy . " ) else : print ( " Oh , ▁ my ▁ keyboard ! " ) NEW_LINE


def f1 ( list3 ) : return list ( set ( list3 ) ) import sysn = int ( input ( ) ) list1 = list ( range ( 1 , n + 1 ) ) list2 = list ( map ( int , input ( ) . split ( ) ) ) list3 = list ( map ( int , input ( ) . split ( ) ) ) list4 = list2 [ 1 : ] list5 = list3 [ 1 : ] if list2 [ 0 ] + list3 [ 0 ] < n : print ( ' Oh , ▁ my ▁ keyboard ! ' ) sys . exit ( ) list6 = list4 + list5 NEW_LINE


n = int ( input ( ) ) x = list ( map ( int , input ( ) . split ( ) ) ) y = list ( map ( int , input ( ) . split ( ) ) ) l = x [ 1 : ] + y [ 1 : ] l = set ( l ) if len ( l ) == n : print ( " I ▁ become ▁ the ▁ guy . " ) else : print ( " Oh , ▁ my ▁ keyboard ! " ) NEW_LINE


games = int ( input ( ) ) x = input ( ) . split ( " ▁ " ) y = input ( ) . split ( " ▁ " )   x . pop ( 0 ) y . pop ( 0 )   levels = x + y   for i in range ( 1 , games + 1 ) : if str ( i ) not in levels : print ( " Oh , ▁ my ▁ keyboard ! " ) break   if i == games and str ( i ) in levels : print ( " I ▁ become ▁ the ▁ guy . " ) break NEW_LINE


import java . util . Scanner ; public class Main {   public static void main ( String [ ] args ) { Scanner input = new Scanner ( System . in ) ; int n = input . nextInt ( ) ; int s [ ] = new int [ n + 1 ] ; int p = input . nextInt ( ) ; int f = 0 ; int c ; for ( int i = 1 ; i <= p ; i ++ ) { c = input . nextInt ( ) ; s [ c ] ++ ; } int y = input . nextInt ( ) ; for ( int i = 1 ; i <= y ; i ++ ) { c = input . nextInt ( ) ; s [ c ] ++ ; } for ( int i = 1 ; i < s . length ; i ++ ) if ( s [ i ] == 0 ) f = 1 ; if ( f == 0 ) System . out . println ( " I ▁ become ▁ the ▁ guy . " ) ; else System . out . println ( " Oh , ▁ my ▁ keyboard ! " ) ; } }


import java . util . LinkedHashSet ; import java . util . Scanner ; import java . util . Set ;   public class i_Wanna_Be_The_Guy { public static void main ( String [ ] args ) { Scanner sc = new Scanner ( System . in ) ;   int n = sc . nextInt ( ) ; int p = sc . nextInt ( ) ; Set < Integer > elements = new LinkedHashSet < > ( ) ;   while ( p -- >= 1 ) { elements . add ( sc . nextInt ( ) ) ; } int q = sc . nextInt ( ) ; while ( q -- >= 1 ) { elements . add ( sc . nextInt ( ) ) ; } if ( elements . size ( ) == n ) { System . out . println ( " I ▁ become ▁ the ▁ guy . " ) ; } else System . out . println ( " Oh , ▁ my ▁ keyboard ! " ) ; } }


import java . util . Scanner ;   public class A { public static void main ( String [ ] args ) { Scanner sc = new Scanner ( System . in ) ; int t = sc . nextInt ( ) ; while ( t -- > 0 ) { long a , b , c ; a = sc . nextLong ( ) ; b = sc . nextLong ( ) ; c = sc . nextLong ( ) ; System . out . println ( ( a + b + c ) / 2 ) ; } } }

for t in range ( int ( input ( ) ) ) : a = list ( map ( int , input ( ) . split ( ) ) ) print ( sum ( a ) // 2 ) NEW_LINE


t = int ( input ( ) ) for i in range ( t ) : a , b , c = map ( int , input ( ) . split ( ) ) s = a + b + c print ( s // 2 ) NEW_LINE


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


import sys , math , itertoolsfrom collections import Counter , deque , defaultdictfrom bisect import bisect_left , bisect_right from heapq import heappop , heappush , heapifymod = 10 ** 9 + 7 INF = float ( ' inf ' ) def inp ( ) : return int ( sys . stdin . readline ( ) ) def inpl ( ) : return list ( map ( int , sys . stdin . readline ( ) . split ( ) ) ) def inpl_1 ( ) : return list ( map ( lambda x : int ( x ) - 1 , sys . stdin . readline ( ) . split ( ) ) ) def inps ( ) : return sys . stdin . readline ( ) def inpsl ( x ) : tmp = inps ( ) ; return list ( tmp [ : x ] ) def err ( x ) : print ( x ) ; exit ( )   for _ in range ( inp ( ) ) : a = inpl ( ) print ( sum ( a ) // 2 ) NEW_LINE


import java . io . BufferedReader ; import java . io . IOException ; import java . io . InputStreamReader ; import java . util . Arrays ; import java . util . HashMap ; import java . util . Random ; import java . util . * ; import java . util . StringTokenizer ; import java . util . Scanner ; public class Comptetive { static class Pair { int f ; int s ; Pair ( int f , int s ) { this . f = f ; this . s = s ; } } public static void main ( String [ ] args ) { FastScanner fs = new FastScanner ( ) ; int q = fs . nextInt ( ) ; while ( q -- != 0 ) { long a = fs . nextLong ( ) , b = fs . nextLong ( ) , c = fs . nextLong ( ) ; long sum = a + b + c ; System . out . println ( sum / 2 ) ; } } static int pow ( int x , int y ) { if ( y == 0 ) return 1 ; int res = pow ( x , y / 2 ) ; if ( y % 2 == 0 ) { return res * res ; } else { return res * res * x ; } } static final Random random = new Random ( ) ; static void ruffleSort ( int [ ] a ) { int n = a . length ;


import java . io . BufferedReader ; import java . io . IOException ; import java . io . InputStreamReader ; import java . util . StringTokenizer ;   public class A_Three_Piles_of_Candies {   static Scanner scanner = new Scanner ( ) ; static int testCases ; static long a , b , c ; public static void main ( String [ ] args ) throws IOException { testCases = scanner . nextInt ( ) ; for ( int i = 0 ; i < testCases ; i ++ ) { a = scanner . nextLong ( ) ; b = scanner . nextLong ( ) ; c = scanner . nextLong ( ) ; System . out . println ( ( a + b + c ) / 2 ) ; } } static class Scanner { BufferedReader in ; StringTokenizer st ;   public Scanner ( ) {   in = new BufferedReader ( new InputStreamReader ( System . in ) ) ; }   String next ( ) throws IOException { while ( st == null || ! st . hasMoreElements ( ) ) { st = new StringTokenizer ( in . readLine ( ) ) ; } return st . nextToken ( ) ; } String nextLine ( ) throws IOException { return in . readLine ( ) ; } int nextInt ( ) throws IOException { return Integer . parseInt ( next ( ) ) ; } long nextLong ( ) throws IOException { return Long . parseLong ( next ( ) ) ; } } }


import java . util . Scanner ;   public class Nk { public static void main ( String [ ] args ) { Scanner input = new Scanner ( System . in ) ;   int t = input . nextInt ( ) ;   while ( t -- > 0 ) {   long a = input . nextLong ( ) ; long b = input . nextLong ( ) ; long c = input . nextLong ( ) ; long u = ( a + b + c ) / 2 ;   System . out . println ( u ) ; } } }


import java . util . * ;   public class Check2 { public static void main ( String [ ] args ) { Scanner sc = new Scanner ( System . in ) ; long n = sc . nextLong ( ) ; String s = String . valueOf ( n ) ; long copy1 = n ; if ( n >= 10 ) { long y1 = ( long ) ( n / ( Math . pow ( 10 , s . length ( ) - 1 ) ) ) + 1 ;

s = input ( ) s = s [ 1 : ]   l = len ( s ) bigg = 10 ** lif not s : print ( 1 ) else : print ( bigg - int ( s ) ) NEW_LINE


n = input ( )   l = len ( n ) f = int ( n [ 0 ] ) f = f + 1   n = int ( n )   x = 1 for i in range ( l - 1 ) : x = x * 10   print ( f * x - n )     NEW_LINE


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


n = int ( input ( ) ) l = 0 tmp = nwhile n > 0 : r = n % 10 n = n // 10 l += 1 if tmp < 10 : print ( 1 ) else : print ( ( r + 1 ) * ( 10 ** ( l - 1 ) ) - tmp ) NEW_LINE


def culc ( ) : for i in range ( 10 ) : for j in range ( 1 , 10 ) : yield j * 10 ** i   n = int ( input ( ) )   for i in culc ( ) : if i > n : print ( i - n ) break NEW_LINE


import java . util . * ; import java . util . jar . JarOutputStream ;   public class Practise {   public static int [ ] [ ] dp ; public static void main ( String [ ] args ) {


import java . util . * ; import java . io . * ; import java . util . stream . * ; public class Solution { public static void main ( String [ ] args ) throws Exception { Scanner scan = new Scanner ( System . in ) ; int n = scan . nextInt ( ) ; int result = 0 ; int temp = n ; int pow = 1 ; while ( temp >= 10 ) { temp = temp / 10 ; pow = pow * 10 ; } result = ( ( temp + 1 ) * pow ) - n ; System . out . println ( result ) ; } }


import java . util . * ;   public class Solve {   static Scanner scan = new Scanner ( System . in ) ;   public static void solve ( long n , long m ) {   long count = 0 , temp ;   if ( m % n == 0 ) { temp = m / n ; while ( temp % 2 == 0 ) { count ++ ; temp /= 2 ; } while ( temp % 3 == 0 ) { count ++ ; temp /= 3 ; } if ( temp == 1 ) { System . out . println ( count ) ; } else { System . out . println ( - 1 ) ; } } else { System . out . println ( - 1 ) ; } }   public static void main ( String [ ] args ) {   int n = scan . nextInt ( ) ;   int [ ] arr = new int [ 2460 ] ; while ( n -- > 0 ) { int h = scan . nextInt ( ) ; int m = scan . nextInt ( ) ;   arr [ h * 100 + m ] ++ ; } int max = 1 ; for ( int j : arr ) { if ( max < j ) { max = j ; } } System . out . println ( max ) ; } }

visitor = dict ( ) for __ in range ( int ( input ( ) ) ) : h , m = map ( int , input ( ) . split ( ) ) visitor [ ( h , m ) ] = visitor . get ( ( h , m ) , 0 ) + 1 print ( max ( visitor . values ( ) ) ) NEW_LINE


n = int ( input ( ) ) list1 = [ ] list2 = [ ] cas = 1 answer = [ ] for i in range ( n ) : h , m = map ( int , input ( ) . split ( ) ) list1 . append ( m ) list2 . append ( h ) for j in range ( 1 , len ( list1 ) ) : if list2 [ j ] == list2 [ j - 1 ] and list1 [ j ] == list1 [ j - 1 ] : cas += 1 if list2 [ j ] != list2 [ j - 1 ] or list1 [ j ] != list1 [ j - 1 ] : answer . append ( cas ) cas = 1 if j == len ( list1 ) - 1 : answer . append ( cas ) if len ( answer ) == 0 : print ( 1 ) else : print ( max ( answer ) ) NEW_LINE


count , prev , great_count = 1 , - 1 , 0 for i in range ( int ( input ( ) ) ) : h , m = map ( int , input ( ) . split ( ) )   if h * 60 + m == prev : count += 1 else : prev = h * 60 + m if count > great_count : great_count = count count = 1   print ( max ( great_count , count ) ) NEW_LINE


count , prev , great_count = 1 , - 1 , 1 for i in range ( int ( input ( ) ) ) : h , m = map ( int , input ( ) . split ( ) )   if h * 60 + m == prev : count += 1 if count > great_count : great_count = count else : count = 1 prev = h * 60 + m   print ( great_count ) NEW_LINE


n = int ( input ( ) ) a = - 1 b = - 1 mmm = 0 c = 1 while n > 0 : n -= 1 h , m = map ( int , input ( ) . split ( ) ) if h == a and b == m : c += 1 else : c = 1 if c > mmm : mmm = c a = h b = m   print ( mmm ) NEW_LINE


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


import java . util . HashMap ; import java . util . Scanner ;   public class Problem_237A { public static void main ( String [ ] args ) { Scanner s = new Scanner ( System . in ) ; int n = s . nextInt ( ) ; HashMap < String , Integer > timeFreq = new HashMap < > ( ) ; int cashes = 1 ; while ( n -- > 0 ) { String H = s . next ( ) ; String M = s . next ( ) ; String time = H . concat ( " : " ) . concat ( M ) ;   timeFreq . computeIfPresent ( time , ( K , V ) -> V + 1 ) ; timeFreq . putIfAbsent ( time , 1 ) ; cashes = Math . max ( timeFreq . get ( time ) , cashes ) ; }   System . out . println ( cashes ) ; } }


import java . util . ArrayList ; import java . util . Arrays ; import java . util . Scanner ;   public class P237A { public static void main ( String [ ] args ) { Scanner sc = new Scanner ( System . in ) ; int n = sc . nextInt ( ) ; int [ ] hash = new int [ 2460 ] ; int time = 0 , count = 0 ; for ( int i = 0 ; i < n ; i ++ ) { int hi = sc . nextInt ( ) ; int mi = sc . nextInt ( ) ; time = hi * 100 + mi ; count = Math . max ( count , ++ hash [ time ] ) ; } System . out . println ( count ) ; } }


import java . util . Scanner ;   public class StrangePartition { public static void main ( String [ ] args ) { Scanner scanner = new Scanner ( System . in ) ; int n , x ; int [ ] ints ; int testCases = scanner . nextInt ( ) ; long [ ] [ ] result = new long [ testCases ] [ 2 ] ; long [ ] base ; for ( int i = 0 ; i < testCases ; i ++ ) { n = scanner . nextInt ( ) ; x = scanner . nextInt ( ) ; ints = new int [ n ] ;   for ( int j = 0 ; j < n ; j ++ ) { ints [ j ] = scanner . nextInt ( ) ; }   base = solve ( ints , x ) ;   for ( int k = 0 ; k < 2 ; k ++ ) { result [ i ] [ k ] = base [ k ] ; }   }   for ( int i = 0 ; i < testCases ; i ++ ) { for ( int i1 = 0 ; i1 < 2 ; i1 ++ ) { System . out . print ( result [ i ] [ i1 ] + " ▁ " ) ; } System . out . println ( ) ; } }   public static long [ ] solve ( int [ ] ints , int x ) { long min ; long sum = 0 ; long max = 0 ; for ( int i = 0 ; i < ints . length ; i ++ ) { sum += ints [ i ] ; max += ( long ) Math . ceil ( ( double ) ints [ i ] / x ) ; } min = ( long ) Math . ceil ( ( double ) sum / x ) ; long [ ] result = { min , max } ; return result ; } }

import math     for testcase in range ( int ( input ( ) ) ) : arr = [ int ( x ) for x in input ( ) . split ( ) ] NEW_LINE n , k = arr [ 0 ] , arr [ 1 ] NEW_LINE arr = [ int ( x ) for x in input ( ) . split ( ) ] NEW_LINE c , s = 0 , 0 NEW_LINE for ele in arr : if NEW_LINE INDENT ( ele % k != 0 ) : c += 1 NEW_LINE DEDENT s += ele NEW_LINE maxc , minc = 0 , 0 NEW_LINE for ele in arr : if NEW_LINE INDENT ( ele % k == 0 ) : maxc += ( ele // k ) NEW_LINE DEDENT minc += ( ele // k ) else : m = math . ceil ( ele / k ) NEW_LINE maxc += m NEW_LINE m = math . ceil ( s / k ) NEW_LINE minc += m NEW_LINE print ( minc , maxc ) NEW_LINE


from math import ceilfor NEW_LINE _ in range ( int ( input ( ) ) ) : n , k = map ( int , input ( ) . split ( ) ) NEW_LINE l = list ( map ( int , input ( ) . split ( ' ▁ ' ) ) ) NEW_LINE maxi = ans = value = 0 NEW_LINE for i in l : maxi += ceil ( i / k ) NEW_LINE for i in l : if NEW_LINE i % k == 0 : ans += i // k else : value += i NEW_LINE if value % k == 0 : ans += value // k NEW_LINE value = 0 NEW_LINE ans += ceil ( value / k ) NEW_LINE print ( ans , maxi ) NEW_LINE


from math import ceilt = int ( input ( ) )   for i in range ( t ) : n , x = map ( int , input ( ) . split ( ) ) NEW_LINE a = list ( map ( int , input ( ) . split ( ) ) )   max_a = 0 NEW_LINE for j in a : max_a += ceil ( j / x ) NEW_LINE min_a = ceil ( sum ( a ) / x )   print ( min_a , max_a ) NEW_LINE


import io , os , sysfrom NEW_LINE math NEW_LINE import ceil NEW_LINE input = io . BytesIO ( os . read ( 0 , os . fstat ( 0 ) . st_size ) ) . readline NEW_LINE def sswrite ( val ) : sys . stdout . write ( str ( val ) + ' \n ' ) NEW_LINE def intmap ( ) : return map ( int , input ( ) . decode ( ) . split ( ' ▁ ' ) ) NEW_LINE t = int ( input ( ) . decode ( ) ) NEW_LINE def solve ( n , x , a ) : x1 = ceil ( sum ( a ) / x ) NEW_LINE x2 = 0 NEW_LINE for i in range ( n ) : x2 += ceil ( a [ i ] / x ) NEW_LINE return f ' { x1 } ▁ { x2 } ' NEW_LINE for i in range ( t ) : n , x = intmap ( ) NEW_LINE a = list ( intmap ( ) ) NEW_LINE print ( solve ( n , x , a ) ) NEW_LINE


import java . util . Scanner ;   public class AStrangePartition { public static void main ( String [ ] args ) { Scanner sc = new Scanner ( System . in ) ; int t = sc . nextInt ( ) ; while ( t -- > 0 ) { long n = sc . nextInt ( ) ; long k = sc . nextInt ( ) ; long ans1 = 0 ; long sum = 0 ; for ( long i = 0 ; i < n ; i ++ ) { long x = sc . nextInt ( ) ; sum += x ; ans1 += ( x + k - 1 ) / k ; } long ans2 = ( sum + k - 1 ) / k ; System . out . println ( ans2 + " ▁ " + ans1 ) ; } sc . close ( ) ; } }


import java . util . Scanner ;   public class StrangePartition { public static void main ( String [ ] args ) { Scanner scanner = new Scanner ( System . in ) ; int n , x ; int [ ] ints ; int testCases = scanner . nextInt ( ) ; long [ ] [ ] result = new long [ testCases ] [ 2 ] ; long [ ] base ; for ( int i = 0 ; i < testCases ; i ++ ) { n = scanner . nextInt ( ) ; x = scanner . nextInt ( ) ; ints = new int [ n ] ;   for ( int j = 0 ; j < ints . length ; j ++ ) { ints [ j ] = scanner . nextInt ( ) ; }   base = solve ( ints , x ) ;   for ( int k = 0 ; k < 2 ; k ++ ) { result [ i ] [ k ] = base [ k ] ; }   }   for ( int i = 0 ; i < testCases ; i ++ ) { for ( int i1 = 0 ; i1 < 2 ; i1 ++ ) { System . out . print ( result [ i ] [ i1 ] + " ▁ " ) ; } System . out . println ( ) ; } }   public static long [ ] solve ( int [ ] ints , int x ) { long min ; long sum = 0 ; double max = 0 ; for ( int i = 0 ; i < ints . length ; i ++ ) { sum += ints [ i ] ; max += Math . ceil ( ( double ) ints [ i ] / x ) ; } min = ( long ) Math . ceil ( ( double ) sum / x ) ; long [ ] result = { min , ( long ) max } ; return result ; } }


import java . util . Scanner ;   public class A1471 {   public static void main ( String [ ] args ) { Scanner in = new Scanner ( System . in ) ; int T = in . nextInt ( ) ; for ( int t = 0 ; t < T ; t ++ ) { int N = in . nextInt ( ) ; long X = in . nextLong ( ) ; long maxBeauty = 0 ; long sum = 0 ; for ( int n = 0 ; n < N ; n ++ ) { int a = in . nextInt ( ) ; sum += a ; maxBeauty += ( a + X - 1 ) / X ; } long minBeauty = ( sum + X - 1 ) / X ; System . out . println ( minBeauty + " ▁ " + maxBeauty ) ; } }   }


import java . util . Scanner ; public class Main { public static void main ( String args [ ] ) { Scanner scan = new Scanner ( System . in ) ; int n = scan . nextInt ( ) ; String [ ] arr = new String [ n ] ; int temp = n ; scan . nextLine ( ) ; int j = 0 ; while ( n -- != 0 ) { String s = scan . nextLine ( ) ; arr [ j ] = s ; j ++ ; } int c = 0 , m = 0 , index = - 1 ; int k = 0 ; while ( temp -- != 0 ) { if ( arr [ k ] . equals ( arr [ 0 ] ) ) { c ++ ; } else { index = k ; m ++ ; } k ++ ; } if ( c > m ) { System . out . print ( arr [ 0 ] ) ; } else { System . out . print ( arr [ index ] ) ; } } }

counter = { } max_goal = 0 for _ in range ( int ( input ( ) ) ) : team = input ( ) counter [ team ] = counter . get ( team , 0 ) + 1 max_goal = max ( max_goal , counter [ team ] )   for team in counter . keys ( ) : if counter [ team ] == max_goal : print ( team ) NEW_LINE


l = list ( ) for i in range ( int ( input ( ) ) ) : s = input ( ) l . append ( s ) print ( max ( l , key = l . count ) ) NEW_LINE


d1 = { }   for i in range ( int ( input ( ) ) ) : s1 = input ( ) if ( s1 in d1 ) : d1 [ s1 ] += 1 else : d1 [ s1 ] = 1 l1 = list ( d1 . values ( ) ) l2 = list ( d1 . keys ( ) ) print ( l2 [ l1 . index ( max ( l1 ) ) ] ) NEW_LINE


N = int ( input ( ) ) ch = input ( ) equipe1 = chNb1 = 1 Nb2 = 0 for i in range ( 1 , N ) : ch = input ( ) if ( ch == equipe1 ) : Nb1 += 1 else : equipe2 = ch Nb2 += 1 if ( Nb1 > Nb2 ) : print ( equipe1 ) else : print ( equipe2 ) NEW_LINE


import java . util . * ; public class Main { public static void main ( String [ ] args ) { Scanner sc = new Scanner ( System . in ) ; int countA = 0 ; int countB = 0 ; int n = sc . nextInt ( ) ; String a = sc . next ( ) ; String b = " " ; countA ++ ; while ( n -- > 1 ) { String y = sc . next ( ) ; if ( y . equals ( a ) ) { countA ++ ; } else { b = y ; countB ++ ; } } System . out . println ( countA > countB ? a : b ) ; } }


import java . util . * ;   public class NewClass { public static void main ( String args [ ] ) { Scanner sc = new Scanner ( System . in ) ; int n = sc . nextInt ( ) , cx = 0 , cy = 0 ; String x = null , y = null ; for ( int i = 0 ; i < n ; i ++ ) { String g = sc . next ( ) ; if ( x == null ) { x = g ; cx ++ ; } else if ( y == null && ! g . equals ( x ) ) { y = g ; cy ++ ; } else if ( g . equals ( y ) ) cy ++ ; else cx ++ ; } if ( cy > cx ) System . out . println ( y ) ; else System . out . println ( x ) ; } }


import java . io . BufferedReader ; import java . io . File ; import java . io . FileInputStream ; import java . io . FileNotFoundException ; import java . io . FileOutputStream ; import java . io . InputStreamReader ; import java . io . PrintWriter ; import java . math . BigInteger ; import java . util . ArrayList ; import java . util . Arrays ; import java . util . BitSet ; import java . util . Calendar ; import java . util . Collections ; import java . util . Comparator ; import java . util . HashMap ; import java . util . HashSet ; import java . util . LinkedList ; import java . util . PriorityQueue ; import java . util . SortedSet ; import java . util . Stack ; import java . util . StringTokenizer ; import java . util . TreeMap ; import java . util . TreeSet ;   public class B_Round_573_Div1 { public static long MOD = 1000000007 ; static int [ ] dp ;   public static void main ( String [ ] args ) throws FileNotFoundException {

n = int ( input ( ) ) a = [ - 1 ] + list ( map ( int , input ( ) . split ( ) ) ) s = set ( ) s . add ( - 1 ) a . sort ( ) count , add = 0 , 0 flag = 0 for i in range ( 1 , n + 1 ) : if a [ i ] in s and a [ i ] - 1 in s : flag = 1 break if a [ i ] in s : add += 1 if ( add == 2 ) : flag = 1 break s . add ( a [ i ] ) count += a [ i ] - ( i - 1 ) if ( flag == 0 and count % 2 == 1 ) : print ( " sjfnb " ) else : print ( " cslnb " ) NEW_LINE


import java . util . * ; import java . util . Arrays ;   public class Main { static int inf = 1000000000 ; static int MOD = 1000000007 ; public static void main ( String ards [ ] ) { Scanner cin = new Scanner ( System . in ) ; int n = cin . nextInt ( ) ; long [ ] a = new long [ 100010 ] ; for ( int i = 1 ; i <= n ; i ++ ) { a [ i ] = cin . nextLong ( ) ; } Arrays . sort ( a , 1 , n + 1 ) ; int flag = 0 ; long sum = 0 ; for ( int i = 1 ; i < n ; i ++ ) { if ( a [ i ] == a [ i + 1 ] ) { flag ++ ; if ( a [ i ] == a [ i - 1 ] + 1 && i > 1 ) { flag ++ ; } } sum += a [ i ] - i + 1 ; } sum += a [ n ] - n + 1 ; if ( flag > 1 ) { System . out . println ( " cslnb " ) ; } else if ( a [ 1 ] == 0 && a [ 2 ] == 0 ) { System . out . println ( " cslnb " ) ; } else { if ( sum % 2 == 0 ) { System . out . println ( " cslnb " ) ; } else { System . out . println ( " sjfnb " ) ; } } } }


import java . util . * ; import java . io . * ;   public class TokitsukazeCSLandStoneGame {


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

import sys   input = sys . stdin . readlines = input ( ) . strip ( ) xc = yc = zc = 0 xlis , ylis , zlis = [ 0 ] , [ 0 ] , [ 0 ] for i in s : xlis . append ( xlis [ - 1 ] + int ( i == ' x ' ) ) ylis . append ( ylis [ - 1 ] + int ( i == ' y ' ) ) zlis . append ( zlis [ - 1 ] + int ( i == ' z ' ) ) for __ in range ( int ( input ( ) ) ) : l , r = map ( int , input ( ) . split ( ) ) if r - l < 2 : print ( ' YES ' ) continue xc = xlis [ r ] - xlis [ l - 1 ] yc = ylis [ r ] - ylis [ l - 1 ] zc = zlis [ r ] - zlis [ l - 1 ] if max ( xc , yc , zc ) - min ( xc , yc , zc ) > 1 : print ( ' NO ' ) else : print ( ' YES ' ) NEW_LINE


from sys import stdin , stdout   def readIn ( ) : return tuple ( map ( int , input ( ) . split ( ) ) )   s = input ( ) sz = len ( s ) + 1 cnt = [ [ 0 ] * 3 for _ in range ( sz ) ] for i in range ( sz - 1 ) : for j in range ( 3 ) : cnt [ i + 1 ] [ j ] = cnt [ i ] [ j ] if s [ i ] == ' x ' : cnt [ i + 1 ] [ 0 ] += 1 elif s [ i ] == ' y ' : cnt [ i + 1 ] [ 1 ] += 1 else : cnt [ i + 1 ] [ 2 ] += 1   n = int ( input ( ) ) res = [ ] for _ in range ( n ) : l , r = readIn ( ) tmp = [ cnt [ r ] [ i ] - cnt [ l - 1 ] [ i ] for i in range ( 3 ) ] res . append ( ' YES ' if r - l < 2 or max ( tmp ) - min ( tmp ) < 2 else ' NO ' ) print ( ' \n ' . join ( res ) ) NEW_LINE


from sys import stdin , stdout   def readIn ( ) : return ( map ( int , input ( ) . split ( ) ) )   s = input ( ) sz = len ( s ) + 1 cnt = [ [ 0 ] * 3 for _ in range ( sz ) ] for i in range ( sz - 1 ) : for j in range ( 3 ) : cnt [ i + 1 ] [ j ] = cnt [ i ] [ j ] if s [ i ] == ' x ' : cnt [ i + 1 ] [ 0 ] += 1 elif s [ i ] == ' y ' : cnt [ i + 1 ] [ 1 ] += 1 else : cnt [ i + 1 ] [ 2 ] += 1   n = int ( input ( ) ) res = [ ] for _ in range ( n ) : l , r = readIn ( ) tmp = [ cnt [ r ] [ i ] - cnt [ l - 1 ] [ i ] for i in range ( 3 ) ] res . append ( ' YES ' if r - l < 2 or max ( tmp ) - min ( tmp ) < 2 else ' NO ' ) print ( ' \n ' . join ( res ) ) NEW_LINE


def f ( t ) : return t [ 2 ] - t [ 0 ] > 1   t = input ( )   n , m , p = len ( t ) , int ( input ( ) ) , { ' x ' : 0 , ' y ' : 1 , ' z ' : 2 }   s = [ [ 0 ] * ( n + 1 ) for i in range ( 3 ) ]   for i , c in enumerate ( t , 1 ) : s [ p [ c ] ] [ i ] = 1   for i in range ( 3 ) :   for j in range ( 1 , n ) : s [ i ] [ j + 1 ] += s [ i ] [ j ]   a , b , c = s   q , d = [ map ( int , input ( ) . split ( ) ) for i in range ( m ) ] , [ ' YES ' ] * m   for i , ( l , r ) in enumerate ( q ) :   if r - l > 1 and f ( sorted ( [ a [ r ] - a [ l - 1 ] , b [ r ] - b [ l - 1 ] , c [ r ] - c [ l - 1 ] ] ) ) : d [ i ] = ' NO '   print ( ' \n ' . join ( d ) )   NEW_LINE


s = input ( ) cnt = list ( [ 0 ] * 3 for _ in range ( len ( s ) + 1 ) ) for i in range ( len ( s ) ) : for j in range ( 3 ) : cnt [ i + 1 ] [ j ] = cnt [ i ] [ j ] if s [ i ] == ' x ' : cnt [ i + 1 ] [ 0 ] += 1 elif s [ i ] == ' y ' : cnt [ i + 1 ] [ 1 ] += 1 else : cnt [ i + 1 ] [ 2 ] += 1 n = int ( input ( ) ) res = [ ] for _ in range ( n ) : l , r = map ( int , input ( ) . split ( ) ) t = [ cnt [ r ] [ i ] - cnt [ l - 1 ] [ i ] for i in range ( 3 ) ] res . append ( ' YES ' if r - l < 2 or max ( t ) - min ( t ) < 2 else ' NO ' ) print ( ' \n ' . join ( res ) ) NEW_LINE


import java . util . * ; import java . util . Map . Entry ; import java . io . * ; import java . text . * ;   import static java . lang . System . out ; import static java . util . Arrays . * ; import static java . lang . Math . * ; public class ContestMain { private static Reader in = new Reader ( ) ; private static StringBuilder ans = new StringBuilder ( ) ; private static long MOD = 1000000007 ;


import java . io . * ;   public class TestClass { public static void main ( String args [ ] ) throws IOException { BufferedReader br = new BufferedReader ( new InputStreamReader ( System . in ) ) ; int n = Integer . parseInt ( br . readLine ( ) ) ; int [ ] arr = new int [ n + 1 ] ; if ( n % 4 > 1 ) System . out . println ( - 1 ) ; else { int loops = n / 4 ; int start_ind = 1 ; int end_ind = n ; int front = 1 ; int end = n ; for ( int i = 0 ; i < loops ; i ++ ) { arr [ end_ind - 1 ] = front ++ ; arr [ start_ind ] = front ++ ; arr [ start_ind + 1 ] = end -- ; arr [ end_ind ] = end -- ;   start_ind += 2 ; end_ind -= 2 ; } if ( n % 2 == 1 ) { arr [ n / 2 + 1 ] = n / 2 + 1 ; }   for ( int i = 1 ; i < arr . length ; i ++ ) { System . out . print ( arr [ i ] + " ▁ " ) ; } } } }

n = int ( input ( ) ) if ( n % 4 > 1 ) : print ( - 1 ) else : ans = [ 0 ] * ( n + 1 ) i , j , a , b = 1 , n , 1 , n while ( i < j and a <= n and b >= 1 ) : ans [ i ] , ans [ j ] = a + 1 , b - 1 ans [ i + 1 ] , ans [ j - 1 ] = b , a i += 2 j -= 2 a += 2 b -= 2 if ( i == j ) : ans [ i ] = a for i in range ( 1 , n + 1 ) : print ( ans [ i ] , end = ' ▁ ' ) NEW_LINE


import sysfrom collections import dequen = int ( input ( ) ) if n % 4 == 2 or n % 4 == 3 : print ( ' - 1' ) sys . exit ( )   arr = [ None ] * ( n + 1 ) qt = deque ( [ i for i in range ( 1 , n + 1 ) ] ) mark = set ( ) while qt : while qt and qt [ 0 ] in mark : qt . popleft ( ) if not qt : break a = qt . popleft ( ) while qt and qt [ 0 ] in mark : qt . popleft ( ) if not qt : break b = qt . popleft ( ) for i in range ( 4 ) : mark . add ( a ) mark . add ( b ) arr [ a ] = b arr [ b ] = n - a + 1 a = b b = arr [ b ]   for i in range ( 1 , n + 1 ) : if not arr [ i ] : arr [ i ] = a breakprint ( ' ▁ ' . join ( map ( str , arr [ 1 : ] ) ) ) NEW_LINE


n = int ( input ( ) ) if n == 1 : print ( 1 ) exit ( ) if n % 4 > 1 : print ( - 1 ) exit ( ) ans = [ - 1 ] * nleft = nstart = n - 2 nums = 1 nume = nwhile left >= 4 : ans [ start ] = nums ans [ nums - 1 ] = nums + 1 ans [ nums ] = nume ans [ nume - 1 ] = nume - 1 start -= 2 nums += 2 nume -= 2 left -= 4 NEW_LINE


import com . sun . org . apache . bcel . internal . generic . AALOAD ; import java . io . BufferedReader ; import java . io . IOException ; import java . io . InputStreamReader ; import java . io . PrintWriter ; import java . math . BigInteger ; import java . util . * ; import java . util . stream . IntStream ; import javafx . util . Pair ;   public class Main {   public static void main ( String [ ] args ) throws IOException {   Scanner input = new Scanner ( System . in ) ; long n , a , b , c ; n = input . nextLong ( ) ;

n , a , b , c = map ( int , input ( ) . split ( ) ) if ( n % 4 == 0 ) : print ( 0 ) else : hf = ( ( n // 4 ) * 4 ) + 4 diff = hf - n if ( diff == 1 ) : print ( min ( a , b + c , 3 * c ) ) elif ( diff == 2 ) : print ( min ( 2 * a , 2 * c , b ) ) else : print ( min ( c , 3 * a , a + b ) ) NEW_LINE


s = list ( map ( int , input ( ) . split ( ) ) ) n = s [ 0 ] a = s [ 1 ] b = s [ 2 ] c = s [ 3 ] if n % 4 == 0 : print ( 0 ) elif n % 4 == 3 : print ( min ( a * 1 , 3 * c , c + b ) ) elif n % 4 == 2 : print ( min ( 2 * a , b , 2 * c ) ) else : print ( min ( 3 * a , b + a , c ) ) NEW_LINE


n , a , b , c = [ int ( i ) for i in input ( ) . split ( ) ] if ( n % 4 == 0 ) : print ( "0" ) elif ( n % 4 == 1 ) : print ( min ( c , min ( a + b , 3 * a ) ) ) elif ( n % 4 == 2 ) : print ( min ( b , min ( 2 * a , 2 * c ) ) ) else : print ( min ( a , min ( b + c , 3 * c ) ) ) NEW_LINE


a , b , c , d = map ( int , input ( ) . split ( ) ) s = a % 4 h = 0   if s == 3 : h = min ( b , 3 * d , c + d ) elif s == 2 : h = min ( 2 * b , c , 2 * d ) elif s == 1 : h = min ( 3 * b , c + b , d ) print ( h ) NEW_LINE


import java . util . * ; import java . lang . * ; import java . io . * ;   public final class alyona { public static void main ( String [ ] args ) throws java . lang . Exception { Reader r = new Reader ( ) ; r . init ( System . in ) ; long n = r . nextInt ( ) ; long a = r . nextInt ( ) ; long b = r . nextInt ( ) ; long c = r . nextInt ( ) ; long buy = ( 4 - ( n % 4 ) ) % 4 ; long ans = 0 ; if ( buy == 1 ) { ans = Math . min ( a , Math . min ( b + c , 3 * c ) ) ; } else if ( buy == 2 ) { ans = Math . min ( 2 * a , Math . min ( b , c * 2 ) ) ; } else if ( buy == 3 ) { ans = Math . min ( a * 3 , Math . min ( c , a + b ) ) ; } else { ans = 0 ; } System . out . println ( ans ) ;   }   static int gcd ( int a , int b ) { if ( a == 0 ) return b ; return gcd ( b % a , a ) ; }   static class Reader { static BufferedReader reader ; static StringTokenizer tokenizer ; static void init ( InputStream input ) { reader = new BufferedReader ( new InputStreamReader ( input ) ) ; tokenizer = new StringTokenizer ( " " ) ; } static String next ( ) throws IOException { while ( ! tokenizer . hasMoreTokens ( ) ) {


import java . util . Scanner ;   public class P740A {   public static void main ( String [ ] args ) { Scanner s = new Scanner ( System . in ) ; long n = s . nextLong ( ) ; long a = s . nextLong ( ) ; long b = s . nextLong ( ) ; long c = s . nextLong ( ) ; if ( n % 4 == 0 ) { System . out . println ( 0 ) ; } else { long min = Long . MAX_VALUE ; for ( int i = 0 ; i < 5 ; i ++ ) { for ( int j = 0 ; j < 5 ; j ++ ) { for ( int k = 0 ; k < 5 ; k ++ ) { if ( ( n + 1 * i + 2 * j + 3 * k ) % 4 == 0 ) { long cost = a * i + b * j + c * k ; min = Math . min ( min , cost ) ; } } } } System . out . println ( min ) ; } } }


import java . io . * ; import java . util . * ; import java . math . BigInteger ;   public class test { static class sort implements Comparator < int [ ] >

import sysinput = sys . stdin . readline   n , q = list ( map ( int , input ( ) . split ( ) ) ) for i in range ( q ) : a = int ( input ( ) ) if a % 2 != 0 : print ( ( a + 1 ) // 2 ) else : b = a // 2 while 1 > 0 : a = a + ( n - b ) b = a // 2 if a % 2 != 0 : print ( ( a + 1 ) // 2 ) break NEW_LINE


''' ▁ CODED ▁ WITH ▁ LOVE ▁ BY ▁ SATYAM ▁ KUMAR ▁ '''   from sys import stdin , stdoutimport heapqimport cProfile , mathfrom collections import Counter , defaultdict , dequefrom bisect import bisect_left , bisect , bisect_rightimport itertoolsfrom copy import deepcopyfrom fractions import Fractionimport sys , threadingimport operator as opfrom functools import reduceimport sys   sys . setrecursionlimit ( 10 ** 6 ) NEW_LINE


from sys import * input = stdin . readlinen , q = map ( int , input ( ) . split ( ) ) for _ in range ( q ) : i = int ( input ( ) ) while i % 2 == 0 : i += n - i // 2 print ( ( i + 1 ) // 2 ) NEW_LINE


import java . io . * ; import java . util . * ; public class Main { public static void main ( String args [ ] ) { FastReader input = new FastReader ( ) ; PrintWriter out = new PrintWriter ( System . out ) ; int T = 1 ; while ( T -- > 0 ) { long n = input . nextLong ( ) ; long q = input . nextLong ( ) ; for ( int i = 0 ; i < q ; i ++ ) { long x = input . nextLong ( ) ; if ( x % 2 != 0 ) { out . println ( x / 2 + 1 ) ; } else { long d = n - 1 ; long y = x / 2 ; d = d - ( y - 1 ) ; while ( true ) { x = x + d ; if ( d % 2 != 0 ) { break ; } d = d / 2 ; } out . println ( x / 2 + 1 ) ; } } } out . close ( ) ; } 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 . io . BufferedReader ; import java . io . FileReader ; import java . io . IOException ; import java . io . InputStreamReader ; import java . util . Scanner ; import java . util . StringTokenizer ; import java . util . * ; import java . io . * ; public class codeforces { static class Student { int x , y ; Student ( int x , int y ) { this . x = x ; this . y = y ;


import java . util . * ; public class Abc { public static void main ( String [ ] args ) { Scanner in = new Scanner ( System . in ) ; long n = in . nextLong ( ) ; int Q = in . nextInt ( ) ; for ( int i = 0 ; i < Q ; i ++ ) { long p = in . nextLong ( ) ; long half = ( n % 2 == 0 ) ? n / 2 : n / 2 + 1 ;   if ( p % 2 == 1 ) { System . out . println ( ( p + 1 ) / 2 ) ; } else { long jump = n - 1 ; jump -= p / 2 - 1 ;


import java . util . * ; public class Main { public static void main ( String [ ] args ) { Scanner sc = new Scanner ( System . in ) ; int n = sc . nextInt ( ) ; int m = sc . nextInt ( ) ; int i = n + 1 ; int j , f ; while ( true ) { f = 1 ; for ( j = 2 ; j <= i / 2 ; j ++ ) { if ( i % j == 0 ) f = 0 ; } if ( f == 1 ) break ; i ++ ; } if ( i == m ) System . out . println ( " YES " ) ; else System . out . println ( " NO " ) ; } }

l = [ 2 , 3 , 5 , 7 , 11 , 13 , 17 , 19 , 23 , 29 , 31 , 37 , 41 , 43 , 47 , 53 ] NEW_LINE x , y = map ( int , input ( ) . split ( ) ) NEW_LINE if ( l [ l . index ( x ) + 1 ] == y ) : NEW_LINE INDENT print ( " YES " ) else : NEW_LINE print ( " NO " ) NEW_LINE DEDENT


x = input ( ) NEW_LINE n , m = x . split ( ) NEW_LINE n , m = int ( n ) , int ( m )   NEW_LINE def is_prime ( number ) : for NEW_LINE i in range ( 2 , number ) : NEW_LINE if ( number % i == 0 ) : return False NEW_LINE return True   for i in range ( n + 1 , m + 1 ) : if NEW_LINE ( is_prime ( i ) ) : NEW_LINE if ( i == m ) : NEW_LINE INDENT print ( " YES " ) else : NEW_LINE print ( " NO " ) NEW_LINE DEDENT break elif ( i == m ) : print ( " NO " )   NEW_LINE


import math   NEW_LINE def sieve ( n ) : nums = [ - 1 , - 1 ] + list ( range ( 2 , n + 1 ) ) NEW_LINE


n , m = [ int ( i ) for i in input ( ) . split ( ) ]   n += 1   while True : c = 0 NEW_LINE for i in range ( 1 , n ) : if NEW_LINE n % i == 0 : c += 1 NEW_LINE if c == 1 : if NEW_LINE n == m : print ( " YES " ) else : print ( " NO " ) NEW_LINE break NEW_LINE n += 1 NEW_LINE


import java . io . DataInputStream ; import java . io . FileInputStream ; import java . io . IOException ; import java . util . Comparator ; import java . util . HashMap ; import java . util . Scanner ; import java . lang . String ;   public class Main { static class point { long val , time , t3 ;   point ( long val , long time , int t3 ) { this . val = val ; this . time = time ;   this . t3 = t3 ; } } 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 A_Panoramix_s_Prediction {   static boolean isPrime ( int n ) { int c = 0 ; for ( int i = 1 ; i <= n ; i ++ ) { if ( n % i == 0 ) c ++ ; } if ( c == 2 ) return true ; return false ; }   static String solve ( ) { int n = sc . nextInt ( ) ; int m = sc . nextInt ( ) ; if ( isPrime ( n ) && isPrime ( m ) ) { for ( int i = n + 1 ; i < m ; i ++ ) { if ( isPrime ( i ) ) return " NO " ; } return " YES " ; } return " NO " ; }   static Scanner sc = new Scanner ( System . in ) ; public static void main ( String arg [ ] ) { System . out . println ( solve ( ) ) ; } }


import java . util . * ; import java . io . * ; import java . math . * ;   public class First {   public static void process ( ) throws IOException { int n = ni ( ) ; String str = nln ( ) ; int R = 0 , B = 0 , G = 0 ; for ( int i = 0 ; i < n ; i ++ ) { char c = str . charAt ( i ) ; if ( c == ' R ' ) { R ++ ; } else if ( c == ' G ' ) { G ++ ; } else { B ++ ; } }

n = int ( input ( ) )   s = input ( )   l = len ( s ) letters = set ( s )   all_letters = { ' B ' , ' G ' , ' R ' }   if len ( letters ) == 3 : print ( ' ' . join ( all_letters ) ) elif len ( letters ) == 2 : if l == 2 : print ( ' ' . join ( sorted ( all_letters - letters ) ) ) else : a , b = letters count_a = s . count ( a ) count_b = s . count ( b ) if count_a >= 2 and count_b >= 2 : print ( ' ' . join ( all_letters ) ) elif count_a > count_b : print ( ' ' . join ( sorted ( ( all_letters - letters ) . union ( b ) ) ) ) elif count_b > count_a : print ( ' ' . join ( sorted ( ( all_letters - letters ) . union ( a ) ) ) ) else : print ( ' ' . join ( letters ) ) NEW_LINE


from collections import Counterimport osimport sysfrom io import BytesIO , IOBase   BUFSIZE = 8192     class FastIO ( IOBase ) : newlines = 0   def __init__ ( self , file ) : self . _fd = file . fileno ( ) self . buffer = BytesIO ( ) self . writable = " x " in file . mode or " r " not in file . mode self . write = self . buffer . write if self . writable else None   def read ( self ) : while True : b = os . read ( self . _fd , max ( os . fstat ( self . _fd ) . st_size , BUFSIZE ) ) if not b : break ptr = self . buffer . tell ( ) self . buffer . seek ( 0 , 2 ) , self . buffer . write ( b ) , self . buffer . seek ( ptr ) self . newlines = 0 return self . buffer . read ( )   def readline ( self ) : while self . newlines == 0 : b = os . read ( self . _fd , max ( os . fstat ( self . _fd ) . st_size , BUFSIZE ) ) self . newlines = b . count ( b " \n " ) + ( not b ) ptr = self . buffer . tell ( ) self . buffer . seek ( 0 , 2 ) , self . buffer . write ( b ) , self . buffer . seek ( ptr ) self . newlines -= 1 return self . buffer . readline ( )   def flush ( self ) : if self . writable : os . write ( self . _fd , self . buffer . getvalue ( ) ) self . buffer . truncate ( 0 ) , self . buffer . seek ( 0 )     class IOWrapper ( IOBase ) : def __init__ ( self , file ) : self . buffer = FastIO ( file ) self . flush = self . buffer . flush self . writable = self . buffer . writable self . write = lambda s : self . buffer . write ( s . encode ( " ascii " ) ) self . read = lambda : self . buffer . read ( ) . decode ( " ascii " ) self . readline = lambda : self . buffer . readline ( ) . decode ( " ascii " )     sys . stdin , sys . stdout = IOWrapper ( sys . stdin ) , IOWrapper ( sys . stdout ) input = lambda : sys . stdin . readline ( ) . rstrip ( " \n " ) NEW_LINE


n = int ( input ( ) ) s = input ( ) d = { ' B ' : 0 , ' G ' : 0 , ' R ' : 0 } for c in s : d [ c ] += 1 vl = d . values ( ) b = max ( vl ) s = min ( vl ) ss = sum ( vl ) if s > 0 or ( b != ss and ss - b > 1 ) : NEW_LINE


from sys import stdin , stdoutn = int ( stdin . readline ( ) ) s = stdin . readline ( ) [ : - 1 ] c1 = 0 c2 = 0 c3 = 0 for i in s : if i == ' R ' : c1 += 1 elif i == ' B ' : c2 += 1 else : c3 += 1 if ( c1 > 0 and c2 > 0 and c3 > 0 ) or ( c1 > 1 and c2 > 1 ) or ( c1 > 1 and c3 > 1 ) or ( c2 > 1 and c3 > 1 ) : print ( ' BGR ' ) elif c1 > 0 : if c2 > 1 : print ( ' GR ' ) elif c3 > 1 : print ( ' BR ' ) elif ( c2 == 1 or c3 == 1 ) and c1 > 1 : print ( ' BG ' ) elif c2 == 1 and c1 == 1 : print ( ' G ' ) elif c1 == 1 and c3 == 1 : print ( ' B ' ) else : print ( ' R ' ) elif c2 > 0 : if c3 > 1 : print ( ' BR ' ) elif c2 > 1 and c3 == 1 : print ( ' GR ' ) elif c2 == 1 and c3 == 1 : print ( ' R ' ) else : print ( ' B ' ) else : print ( ' G ' )       NEW_LINE


from collections import Counter input ( ) F = Counter ( input ( ) ) if len ( F ) < 2 : print ( * F ) elif len ( F ) > 2 : print ( ' BGR ' ) else : f1 , f2 = F . values ( ) if f1 == f2 == 1 : print ( ( set ( ' BGR ' ) - set ( F . keys ( ) ) ) . pop ( ) ) elif f1 > 1 and f2 > 1 : print ( ' BGR ' ) else : print ( * ( c for c in ' BGR ' if c not in F or F [ c ] == 1 ) , sep = ' ' ) NEW_LINE


import java . util . Scanner ;   public class Main { public static void main ( String [ ] args ) { Scanner scanner = new Scanner ( System . in ) ; int cases = scanner . nextInt ( ) ;   for ( int i = 0 ; i < cases ; i ++ ) { int r = scanner . nextInt ( ) ; int g = scanner . nextInt ( ) ; int b = scanner . nextInt ( ) ;   int sum = ( r + g + b ) / 2 ;   sum = Math . min ( sum , r + g ) ; sum = Math . min ( sum , r + b ) ; sum = Math . min ( sum , g + b ) ;   System . out . println ( sum ) ; } } }

for _ in range ( int ( input ( ) ) ) : l = list ( map ( int , input ( ) . split ( ) ) ) l . sort ( ) print ( min ( l [ 0 ] + l [ 1 ] , sum ( l ) // 2 ) ) NEW_LINE


for _ in range ( int ( input ( ) ) ) : l = list ( map ( int , input ( ) . split ( ) ) ) l . sort ( ) if l [ 0 ] + l [ 1 ] <= l [ 2 ] : print ( l [ 0 ] + l [ 1 ] ) else : print ( sum ( l ) // 2 )         NEW_LINE


t = int ( input ( ) ) ans = [ ] for _ in range ( t ) : arr = sorted ( map ( int , input ( ) . split ( ) ) ) if arr [ - 1 ] > arr [ 0 ] + arr [ 1 ] : ans . append ( arr [ 0 ] + arr [ 1 ] ) else : ans . append ( sum ( arr ) // 2 )   for a in ans : print ( a ) NEW_LINE


t = int ( input ( ) ) for _ in range ( t ) : l = list ( map ( int , input ( ) . split ( ) ) ) l . sort ( ) print ( min ( l [ 0 ] + l [ 1 ] , sum ( l ) // 2 ) ) NEW_LINE


import java . util . Arrays ; import java . util . Scanner ;   public class SweetProblem { public static void main ( String [ ] args ) { Scanner scanner = new Scanner ( System . in ) ; int testCase = scanner . nextInt ( ) ; for ( int i = 0 ; i < testCase ; i ++ ) { int [ ] numbers = new int [ 3 ] ; for ( int j = 0 ; j < numbers . length ; j ++ ) { numbers [ j ] = scanner . nextInt ( ) ; } solve ( numbers ) ; }   }   public static void solve ( int [ ] numbers ) { Arrays . sort ( numbers ) ; if ( numbers [ 2 ] >= numbers [ 0 ] + numbers [ 1 ] ) System . out . println ( numbers [ 0 ] + numbers [ 1 ] ) ; else System . out . println ( ( int ) Math . floor ( ( double ) ( numbers [ 0 ] + numbers [ 1 ] + numbers [ 2 ] ) / 2 ) ) ; } }


import javafx . scene . transform . Scale ; import java . util . Arrays ; import java . util . Scanner ; public class sweetProblem { public static void main ( String [ ] args ) { Scanner scanner = new Scanner ( System . in ) ; int num = scanner . nextInt ( ) ; for ( int s = 0 ; s < num ; s ++ ) { long a [ ] = new long [ 3 ] ; for ( int i = 0 ; i < 3 ; i ++ ) { a [ i ] = scanner . nextLong ( ) ; } Arrays . sort ( a ) ; if ( a [ 2 ] >= a [ 0 ] + a [ 1 ] ) System . out . println ( a [ 0 ] + a [ 1 ] ) ; else { System . out . println ( ( a [ 0 ] - ( a [ 2 ] - a [ 1 ] ) ) / 2 + a [ 2 ] ) ; } } } }


import java . util . * ;   public class Solve {   static Scanner scan = new Scanner ( System . in ) ;   public static void solve ( int n , int [ ] a ) { int fingers = 0 ; for ( int i = 0 ; i < n ; i ++ ) { fingers += a [ i ] ; }   int count = 0 ; for ( int i = 1 ; i <= 5 ; i ++ ) { if ( ( fingers + i ) % ( n + 1 ) == 1 ) { count ++ ; } } System . out . println ( 5 - count ) ; }    public static void main ( String [ ] args ) {   int n = scan . nextInt ( ) ; int [ ] a = new int [ n ] ;   for ( int i = 0 ; i < n ; i ++ ) { a [ i ] = scan . nextInt ( ) ; }   solve ( n , a ) ; } }

n = int ( input ( ) ) A = list ( map ( int , input ( ) . split ( ) ) ) f = n + 1 cnt = 0 for i in range ( sum ( A ) + 1 , sum ( A ) + 6 ) : if i % f == 1 : cnt += 1 print ( 5 - cnt ) NEW_LINE


n = int ( input ( ) ) a = n + 1 x = list ( map ( int , input ( ) . split ( ) ) ) c1 = 1 c2 = 0 l1 = [ ] l2 = [ ] for i in x : c1 = c1 + ifor i in range ( c1 , c1 + 5 ) : l1 . append ( i ) for i in l1 : l2 . append ( i % a ) for i in l2 : if i == 1 : pass else : c2 = c2 + 1 print ( c2 ) NEW_LINE


n = int ( input ( ) ) + 1 fingers = sum ( map ( int , input ( ) . split ( ) ) ) start = fingers % noptions = 0 for x in range ( 1 , 6 ) : if ( start + x ) % n != 1 : options += 1 print ( options ) NEW_LINE


n = int ( input ( ) )   fingers = [ int ( i ) for i in input ( ) . split ( ' ▁ ' ) ] fingers = sum ( fingers ) res = 0 for i in range ( 1 , 6 ) : if ( fingers + i - 1 ) % ( n + 1 ) != 0 : res += 1   print ( res ) NEW_LINE


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 . util . Scanner ;   public class Problem_272A { public static void main ( String [ ] args ) { Scanner s = new Scanner ( System . in ) ; int friends = s . nextInt ( ) ; int fingerSum = 0 ; for ( int i = 0 ; i < friends ; i ++ ) fingerSum += s . nextInt ( ) ;   int ways = 0 ; for ( int i = 1 ; i <= 5 ; i ++ ) { if ( ( fingerSum + i ) % ( friends + 1 ) != 1 ) { ways ++ ; } }   System . out . println ( ways ) ;   } }


import java . util . Scanner ; public class Practice { public static void main ( String [ ] args ) {   Scanner sc = new Scanner ( System . in ) ; int no_of_friends = sc . nextInt ( ) ; int other_fingers = 0 ; for ( int i = 0 ; i < no_of_friends ; i ++ ) { other_fingers += sc . nextInt ( ) ; } no_of_friends += 1 ; int ans = 1 ; for ( int i = 1 ; i <= 5 ; i ++ ) { int m = i + other_fingers ; if ( m % no_of_friends != 1 ) { ans += 1 ; } } System . out . println ( ans - 1 ) ; } }


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

t = int ( input ( ) ) for i in range ( t ) : n = int ( input ( ) ) if ( n % 2 == 1 ) : print ( 7 , end = ' ' ) n -= 3 while ( n > 0 ) : print ( 1 , end = ' ' ) n -= 2 print ( ) NEW_LINE


for _ in range ( int ( input ( ) ) ) : n = int ( input ( ) ) if n % 2 == 0 : k = n // 2 print ( "1" * k ) else : k = ( n - 3 ) // 2 print ( "7" + "1" * k ) NEW_LINE


import sysfrom os import pathif ( path . exists ( ' input . txt ' ) and path . exists ( ' output . txt ' ) ) : sys . stdout = open ( ' output . txt ' , ' w ' ) sys . stdin = open ( ' input . txt ' , ' r ' )   NEW_LINE


t = int ( input ( ) ) for i in range ( t ) : n = int ( input ( ) ) if n % 2 == 0 : print ( "1" * ( n // 2 ) ) else : print ( "7" , end = " " ) print ( "1" * ( ( n - 3 ) // 2 ) ) NEW_LINE


import com . sun . security . jgss . GSSUtil ; import org . w3c . dom . Node ;   import javax . print . DocFlavor ; import javax . swing . table . AbstractTableModel ; import java . io . * ; import java . util . * ; import java . util . concurrent . atomic . AtomicReferenceFieldUpdater ;


import java . util . * ; import java . io . * ; public class Main { public static void main ( String [ ] args ) { Scanner sc = new Scanner ( System . in ) ; int t = sc . nextInt ( ) ; while ( t -- > 0 ) { int n = sc . nextInt ( ) , k = 0 ; if ( n % 2 == 0 ) { n = n / 2 ; } else { n -= 3 ; k = 3 ; n = n / 2 ; } if ( n == 0 ) System . out . println ( "7" ) ; else { String str = String . format ( " % 0" + n + " d " , 0 ) . replace ( "0" , "1" ) ; if ( k != 0 ) str = "7" + str ; System . out . println ( str ) ; } } sc . close ( ) ; } }


import java . util . * ; public class Main { public static void main ( String [ ] args ) { Scanner sc = new Scanner ( System . in ) ; int t = sc . nextInt ( ) ; while ( t -- > 0 ) { int n = sc . nextInt ( ) ; StringBuilder sb = new StringBuilder ( " " ) ; while ( n > 3 ) { sb . append ( "1" ) ; n -= 2 ; } String s = sb . toString ( ) ; if ( n == 3 ) s = '7' + s ; if ( n == 2 ) s = s + '1' ; System . out . println ( s ) ; } } }


import java . util . Scanner ;   public class grasshopper { public static void main ( String [ ] args ) { Scanner scan = new Scanner ( System . in ) ; int p = scan . nextInt ( ) , max = scan . nextInt ( ) ; for ( int i = max ; i > p ; i -- ) { boolean good = true ; int f = i ; for ( int j = 2 ; j * j <= i ; j ++ ) { if ( f % j == 0 && j <= p ) { good = false ; break ; } while ( f % j == 0 ) f /= j ; } if ( good && ( f == 1 || f > p ) ) { System . out . println ( i ) ; return ; } } System . out . println ( - 1 ) ; } }

import sysimport mathimport bisectfrom sys import stdin , stdoutfrom math import gcd , floor , sqrt , log2 , ceilfrom collections import defaultdict as ddfrom bisect import bisect_left as bl , bisect_right as brfrom bisect import insortfrom collections import Counterfrom collections import dequefrom heapq import heappush , heappop , heapifyfrom itertools import permutations , combinationsmod = int ( 1e9 ) + 7   ip = lambda : int ( stdin . readline ( ) ) inp = lambda : map ( int , stdin . readline ( ) . split ( ) ) ips = lambda : stdin . readline ( ) . rstrip ( ) out = lambda x : stdout . write ( str ( x ) + " \n " )     import random def primeFactors ( n ) : arr = set ( ) while n % 2 == 0 : arr . add ( 2 ) n = n // 2 for i in range ( 3 , int ( math . sqrt ( n ) ) + 1 , 2 ) : while n % i == 0 : n = n // i arr . add ( i ) if n > 2 : arr . add ( n ) arr = list ( arr ) return arr t = 1 for _ in range ( t ) : p , y = inp ( ) if y == p : ans = - 1 else : for i in range ( y , p , - 1 ) : arr = primeFactors ( i ) flag = True for j in arr : if j >= 2 and j <= p : flag = False break if flag : break if flag : ans = i else : ans = - 1 out ( ans )                                                                                NEW_LINE


from sys import stdin   def firstDiv ( n ) : NEW_LINE


p , y = map ( int , input ( ) . split ( ) )   def div ( n ) : for i in range ( 2 , int ( n ** ( 1 / 2 ) ) + 1 ) : if n % i == 0 : return i return n   while y > p : if div ( y ) > p : print ( y ) break y -= 1   if y <= p : print ( - 1 ) NEW_LINE


def mlt ( ) : return map ( int , input ( ) . split ( ) )     x , y = mlt ( )     def mn ( x ) : n = 2 if x % 2 == 0 : return 2   n = 3 while n * n <= x : if x % n == 0 : return n n += 2   return x     while y > x : if mn ( y ) > x : print ( y ) exit ( 0 ) y -= 1   print ( - 1 ) NEW_LINE


import mathdef printDivisors ( n ) : i = 2 s = set ( ) while i <= math . sqrt ( n ) : if ( n % i == 0 ) : if ( n // i == i ) : s . add ( i )   else : s . add ( i ) s . add ( n // i )   i = i + 1   return s   p , y = map ( int , input ( ) . split ( ) ) m = - 1j = ywhile ( j > p ) : e = printDivisors ( j ) f = 0 for i in e : if i <= p : f = 1 break   if f == 0 : m = j break   j = j - 1   print ( m ) NEW_LINE


import java . io . BufferedReader ; import java . io . IOException ; import java . io . InputStreamReader ; import java . util . Arrays ; import java . util . Scanner ; import java . util . StringTokenizer ; import java . util . ArrayList ; import java . util . TreeSet ; import java . util . Collections ; public class Hello { 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 ( ) ;


import java . io . BufferedReader ; import java . io . BufferedWriter ; import java . io . InputStreamReader ; import java . io . OutputStreamWriter ; import java . util . StringTokenizer ;   public class Main {   public static void main ( String [ ] args ) throws Exception {   BufferedReader br = new BufferedReader ( new InputStreamReader ( System . in ) ) ; BufferedWriter bw = new BufferedWriter ( new OutputStreamWriter ( System . out ) ) ; StringTokenizer st ;   st = new StringTokenizer ( br . readLine ( ) ) ; int p = Integer . parseInt ( st . nextToken ( ) ) ; int y = Integer . parseInt ( st . nextToken ( ) ) ;   boolean [ ] isPrime = new boolean [ 1000001 ] ; for ( int i = 0 ; i <= 1000000 ; i ++ ) { isPrime [ i ] = true ; } isPrime [ 0 ] = false ; isPrime [ 1 ] = false ; for ( int i = 2 ; i <= 1000000 ; i ++ ) { if ( isPrime [ i ] ) { for ( int j = i + i ; j <= 1000000 ; j += i ) { isPrime [ j ] = false ; } } }   int answer = - 1 ; for ( int i = y ; i > p ; i -- ) { boolean flag = true ; for ( int j = 2 ; j <= Math . min ( 1000000 , p ) ; j ++ ) { if ( isPrime [ j ] && i % j == 0 ) { flag = false ; } } if ( flag ) { answer = i ; break ; } }   bw . write ( answer + " " ) ;   bw . flush ( ) ; bw . close ( ) ; br . close ( ) ; }   }


import java . util . * ; public class Main { public static void main ( String [ ] args ) { Scanner infile = new Scanner ( System . in ) ; int T = infile . nextInt ( ) ; while ( T -- > 0 ) { int N = infile . nextInt ( ) ; int [ ] freq = new int [ N + 1 ] ; while ( N -- > 0 ) { freq [ infile . nextInt ( ) ] ++ ; } int res = 0 ; for ( int x : freq ) res = Math . max ( res , x ) ; System . out . println ( res ) ; } } }

t = int ( input ( ) ) NEW_LINE while t : n = int ( input ( ) ) NEW_LINE a = list ( map ( int , input ( ) . split ( ) ) ) NEW_LINE count = 1 NEW_LINE b = [ ] NEW_LINE flag = 0 NEW_LINE for i in range ( len ( a ) - 1 ) : if NEW_LINE a [ i ] == a [ i + 1 ] : count += 1 else : flag = 1 NEW_LINE b . append ( count ) NEW_LINE count = 1 NEW_LINE b . append ( count ) NEW_LINE if b != [ ] : NEW_LINE INDENT print ( max ( b ) ) else : NEW_LINE print ( len ( a ) ) NEW_LINE DEDENT t -= 1     NEW_LINE


for t in range ( int ( input ( ) ) ) : n = int ( input ( ) ) NEW_LINE a = list ( map ( int , input ( ) . split ( ) ) ) NEW_LINE a = sorted ( a , reverse = True , key = a . count ) NEW_LINE print ( a . count ( a [ 0 ] ) ) NEW_LINE


for i in range ( int ( input ( ) ) ) : input ( ) NEW_LINE a = list ( map ( int , input ( ) . split ( ) ) ) NEW_LINE print ( max ( [ a . count ( i ) for i in a ] ) ) NEW_LINE


import matht = int ( input ( ) ) NEW_LINE for i in range ( 0 , t ) : n = int ( input ( ) ) NEW_LINE l = list ( map ( int , input ( ) . split ( ) ) ) NEW_LINE


import java . util . Scanner ;   public class NezzarandColorfulBalls { public static void main ( String args [ ] ) { Scanner scan = new Scanner ( System . in ) ; int t = scan . nextInt ( ) ; while ( t -- > 0 ) { int n = scan . nextInt ( ) ; int [ ] a = new int [ 1010 ] ; for ( int i = 0 ; i < n ; i ++ ) { ++ a [ scan . nextInt ( ) ] ; } int mx = 0 ; for ( int i = 0 ; i < 1010 ; i ++ ) { mx = Math . max ( a [ i ] , mx ) ; } System . out . println ( mx ) ; } } }


import java . util . * ;   public final class Test {   public static void main ( String args [ ] ) { int t ; Scanner sc = new Scanner ( System . in ) ; 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 ( ) ; } System . out . println ( getMinColor ( a ) ) ; } sc . close ( ) ; }   static int getMinColor ( int [ ] numbers ) { int maxDuplicateCount = 0 ; int curDuplicate = 0 ; for ( int i = 0 ; i < numbers . length - 1 ; i ++ ) { curDuplicate = 0 ; while ( i < numbers . length - 1 && numbers [ i ] == numbers [ i + 1 ] ) { curDuplicate ++ ; i ++ ; } if ( curDuplicate > maxDuplicateCount ) { maxDuplicateCount = curDuplicate ; } } return maxDuplicateCount + 1 ; } }


import java . util . * ;   public class Runner { public static void main ( String [ ] args ) { Scanner sc = new Scanner ( System . in ) ; int tests = sc . nextInt ( ) ; for ( int t = 0 ; t < tests ; t ++ ) { int numOfBalls = sc . nextInt ( ) ; sc . nextLine ( ) ; int [ ] balls = stringToIntArray ( sc . nextLine ( ) ) ; int lowestIndex = 0 ; int total = 0 ; for ( int i = 0 ; i < numOfBalls ; i ++ ) { int ithBall = balls [ i ] ; if ( ithBall == - 1 ) continue ; int cur = ithBall ; for ( int j = i + 1 ; j < numOfBalls ; j ++ ) { if ( balls [ i ] == - 1 ) continue ; if ( balls [ j ] > cur ) { cur = balls [ j ] ; balls [ j ] = - 1 ; } } total ++ ; balls [ i ] = - 1 ; } System . out . println ( total ) ; } }   private static int [ ] stringToIntArray ( String str ) { String [ ] strs = str . trim ( ) . split ( " ▁ " ) ; int [ ] intArr = new int [ strs . length ] ; for ( int i = 0 ; i < strs . length ; i ++ ) { intArr [ i ] = Integer . parseInt ( strs [ i ] ) ; } return intArr ; }   }


import java . io . OutputStream ; import java . io . IOException ; import java . io . InputStream ; import java . io . PrintWriter ; import java . util . InputMismatchException ; import java . io . IOException ; 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 { String str ; int n ; int m ; int [ ] [ ] ar ;   public void solve ( int testNumber , InputReader in , PrintWriter out ) { int x , y ; n = in . nextInt ( ) ; m = in . nextInt ( ) ; x = in . nextInt ( ) - 1 ; y = in . nextInt ( ) - 1 ; ar = new int [ n ] [ m ] ; for ( int i = 0 ; i < n ; i ++ ) { for ( int j = 0 ; j < m ; j ++ ) { ar [ i ] [ j ] = Integer . MAX_VALUE ; } } str = in . readString ( ) ;

x , y , x0 , y0 = list ( map ( int , input ( ) . split ( ) ) ) s = input ( ) x0 -= 1 y0 -= 1 k = [ 1 ] summa = 1 a = [ [ 0 ] * ( y ) for i in range ( x ) ] a [ x0 ] [ y0 ] = 1 for i in s : if i == " U " : x0 = max ( x0 - 1 , 0 ) elif i == " D " : x0 = min ( x0 + 1 , x - 1 ) elif i == " R " : y0 = min ( y0 + 1 , y - 1 ) else : y0 = max ( y0 - 1 , 0 ) if a [ x0 ] [ y0 ] : k . append ( 0 ) else : a [ x0 ] [ y0 ] = 1 k . append ( 1 ) summa += 1 k [ - 1 ] += x * y - summaprint ( ' ▁ ' . join ( str ( i ) for i in k ) ) NEW_LINE


X , Y , x , y = map ( int , input ( ) . split ( ) ) s = list ( input ( ) )   dir = { ' U ' : ( - 1 , 0 ) , ' D ' : ( 1 , 0 ) , ' L ' : ( 0 , - 1 ) , ' R ' : ( 0 , 1 ) } field = [ [ 1 ] * Y for i in range ( X ) ]   x -= 1 y -= 1 for c in s : print ( field [ x ] [ y ] ) field [ x ] [ y ] = 0 x += dir [ c ] [ 0 ] y += dir [ c ] [ 1 ] if x < 0 : x = 0 if x >= X : x = X - 1 if y < 0 : y = 0 if y >= Y : y = Y - 1   print ( sum ( sum ( field [ i ] ) for i in range ( X ) ) )   NEW_LINE


X , Y , x , y = map ( int , input ( ) . split ( ) ) s = list ( input ( ) )   dir = { ' U ' : ( - 1 , 0 ) , ' D ' : ( 1 , 0 ) , ' L ' : ( 0 , - 1 ) , ' R ' : ( 0 , 1 ) } field = [ [ 1 ] * Y for i in range ( X ) ]   x -= 1 y -= 1 for c in s : print ( field [ x ] [ y ] ) field [ x ] [ y ] = 0 x += dir [ c ] [ 0 ] y += dir [ c ] [ 1 ] if x < 0 : x = 0 if x >= X : x = X - 1 if y < 0 : y = 0 if y >= Y : y = Y - 1   print ( sum ( sum ( field [ i ] ) for i in range ( X ) ) ) NEW_LINE


x , y , x0 , y0 = map ( int , input ( ) . split ( ) ) s = input ( )   isVisited = [ ] for i in range ( x ) : isVisited . append ( [ ] ) for j in range ( y ) : isVisited [ i ] . append ( False ) cnt = 1 ans = [ "1" ] isVisited [ x0 - 1 ] [ y0 - 1 ] = Truelocx = x0 - 1 locy = y0 - 1 for elem in s : if elem == " U " : locx -= 1 if locx < 0 : locx = 0 if elem == " R " : locy += 1 if locy >= y : locy = y - 1 if elem == " D " : locx += 1 if locx >= x : locx = x - 1 if elem == " L " : locy -= 1 if locy < 0 : locy = 0 if not isVisited [ locx ] [ locy ] : isVisited [ locx ] [ locy ] = True ans . append ( "1" ) cnt += 1 else : ans . append ( "0" ) ans [ - 1 ] = int ( ans [ - 1 ] ) ans [ - 1 ] += x * y - cntans [ - 1 ] = str ( ans [ - 1 ] ) print ( " ▁ " . join ( ans ) ) NEW_LINE


import java . util . Arrays ; import java . util . Comparator ; import java . util . Scanner ;   public class n456A { public static void main ( String [ ] args ) { Scanner scanner = new Scanner ( System . in ) ; int n = scanner . nextInt ( ) ; int [ ] [ ] result = new int [ n ] [ 2 ] ; for ( int i = 0 ; i < n ; i ++ ) { result [ i ] [ 0 ] = scanner . nextInt ( ) ; result [ i ] [ 1 ] = scanner . nextInt ( ) ; } Arrays . sort ( result , new Comparator < int [ ] > ( ) { @ Override public int compare ( int [ ] o1 , int [ ] o2 ) { if ( o1 [ 0 ] < o2 [ 0 ] ) return - 1 ; else if ( o1 [ 0 ] > o2 [ 0 ] ) return 1 ; else { if ( o1 [ 1 ] < o2 [ 1 ] ) return - 1 ; else if ( o1 [ 1 ] > o2 [ 1 ] ) return 1 ; return 0 ; } } } ) ;   int last = result [ 0 ] [ 1 ] ; if ( n == 1 ) { System . out . println ( " Poor ▁ Alex " ) ; } else { for ( int i = 1 ; i < n ; i ++ ) { if ( result [ i ] [ 1 ] < last ) { System . out . println ( " Happy ▁ Alex " ) ; break ; } last = result [ i ] [ 1 ] ; if ( i == n - 1 ) System . out . println ( " Poor ▁ Alex " ) ; } } } }

import sys , functools , collections , bisect , math , heapqinput = sys . stdin . readline NEW_LINE


n = int ( input ( ) ) Test = Falsefor i in range ( n ) : a , b = map ( int , input ( ) . split ( ) ) if a < b : Test = True           if Test : print ( " Happy ▁ Alex " ) else : print ( " Poor ▁ Alex " ) NEW_LINE


n = int ( input ( ) ) a = ' Poor ▁ Alex ' for i in range ( n ) : b , c = map ( int , input ( ) . split ( ) ) if b < c : a = ' Happy ▁ Alex ' print ( a ) NEW_LINE


n = int ( input ( ) ) a = [ ] for i in range ( n ) : p , q = map ( int , input ( ) . split ( ) ) a . append ( [ p , q ] ) a . sort ( key = lambda x : x [ 0 ] ) f = 0 for i in range ( n - 1 ) : if a [ i ] [ 1 ] > a [ i + 1 ] [ 1 ] : f = 1 breakif f : print ( " Happy ▁ Alex " ) else : print ( " Poor ▁ Alex " ) NEW_LINE


import java . io . BufferedReader ; import java . io . IOException ; import java . io . InputStreamReader ; import java . util . ArrayList ; import java . util . Collections ; import java . util . Comparator ; import java . util . StringTokenizer ;   public class Laptops { static FastReader sc = new FastReader ( ) ;   static void input ( int a [ ] ) { for ( int i = 0 ; i < a . length ; i ++ ) { a [ i ] = sc . nextInt ( ) ; } }   static class FastReader { BufferedReader br ; StringTokenizer st ;   public FastReader ( ) { br = new BufferedReader ( new InputStreamReader ( System . in ) ) ; }   String next ( ) { while ( st == null || ! st . hasMoreElements ( ) ) { try { st = new StringTokenizer ( br . readLine ( ) ) ; } catch ( IOException e ) { e . printStackTrace ( ) ; } } return st . nextToken ( ) ; }   int nextInt ( ) { return Integer . parseInt ( next ( ) ) ; }   long nextLong ( ) { return Long . parseLong ( next ( ) ) ; }   double nextDouble ( ) { return Double . parseDouble ( next ( ) ) ; }   String nextLine ( ) { String str = " " ; try { str = br . readLine ( ) ; } catch ( IOException e ) { e . printStackTrace ( ) ; } return str ; } }   static class pair { int a , b ;   pair ( int a , int b ) { this . a = a ; this . b = b ; } }   public static void main ( String [ ] args ) {   int n = sc . nextInt ( ) ; ArrayList < pair > a = new ArrayList < pair > ( ) ; for ( int i = 0 ; i < n ; i ++ ) { int az = sc . nextInt ( ) , bz = sc . nextInt ( ) ; pair p = new pair ( az , bz ) ; a . add ( p ) ;   }


import java . util . * ; public class Laptops {   public static void main ( String [ ] args ) { Scanner sc = new Scanner ( System . in ) ; int n = sc . nextInt ( ) ; boolean found = false ;   ArrayList < LapData > list = new ArrayList < > ( ) ;   for ( int i = 0 ; i < n ; i ++ ) { int price = sc . nextInt ( ) ; int quality = sc . nextInt ( ) ;   LapData l = new LapData ( price , quality ) ; list . add ( l ) ;   } sc . close ( ) ;   Collections . sort ( list , new Comparator < LapData > ( ) { public int compare ( LapData l1 , LapData l2 ) { return l1 . quality - l2 . quality ; } } ) ;   int cp = list . get ( 0 ) . price ; for ( int i = 0 ; i < list . size ( ) ; i ++ ) {   if ( list . get ( i ) . price < cp ) { found = true ; break ; } else { cp = list . get ( i ) . price ; } }   if ( found ) { System . out . println ( " Happy ▁ Alex " ) ; } else System . out . println ( " Poor ▁ Alex " ) ;   } }   class LapData { int price ; int quality ;   public LapData ( int price , int quality ) { this . price = price ; this . quality = quality ; } }


import java . util . ArrayList ; import java . util . Collection ; import java . util . Collections ; import java . util . Comparator ; import java . util . Scanner ;   public class laptop { public static void main ( String [ ] args ) { Scanner sc = new Scanner ( System . in ) ; int n = sc . nextInt ( ) ;


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


import java . io . * ; import java . util . * ; public class Main2 { static BufferedReader br = new BufferedReader ( new InputStreamReader ( System . in ) ) ; static StringTokenizer st ; static String ns ( ) { while ( st == null || ( ! st . hasMoreTokens ( ) ) ) { try { st = new StringTokenizer ( br . readLine ( ) ) ; } catch ( IOException e ) {

import sysinput = sys . stdin . readline   def main ( ) : n , m = map ( int , input ( ) . split ( ) ) a = list ( map ( int , input ( ) . split ( ) ) ) + [ 0 ] * 500000 ans_S = 0 a [ n ] = a [ 0 ] + m s = [ 0 ] * 600600 for i in range ( n ) : s [ i ] = a [ i + 1 ] - a [ i ] s [ n ] = - 1 for i in range ( n ) : s [ 2 * n - i ] = s [ i ] for i in range ( 2 * n + 1 , 3 * n + 1 ) : s [ i ] = s [ i - n ] l , r = 0 , 0 z = [ 0 ] * 600600 for i in range ( 1 , 3 * n + 1 ) : if i < r : z [ i ] = z [ i - l ] while i + z [ i ] <= 3 * n and ( s [ i + z [ i ] ] == s [ z [ i ] ] ) : z [ i ] += 1 if i + z [ i ] > r : l = i r = i + z [ i ] ans = [ ] for i in range ( n + 1 , 2 * n + 1 ) : if z [ i ] < n : continue ans_S += 1 ans . append ( ( a [ 0 ] + a [ 2 * n - i + 1 ] ) % m ) ans . sort ( ) print ( ans_S ) print ( * ans ) return   if __name__ == " _ _ main _ _ " : main ( ) NEW_LINE


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

n = int ( input ( ) )   arr = [ list ( input ( ) ) for _ in range ( n ) ]   for i in range ( n ) : for j in range ( n ) : if i == 0 or i == n - 1 or j == 0 or j == n - 1 : continue if arr [ i ] [ j ] == ' # ' : continue   if arr [ i - 1 ] [ j ] == ' # ' or arr [ i + 1 ] [ j ] == ' # ' or arr [ i ] [ j - 1 ] == ' # ' or arr [ i ] [ j + 1 ] == ' # ' : continue   arr [ i ] [ j ] = ' # ' arr [ i ] [ j + 1 ] = ' # ' arr [ i ] [ j - 1 ] = ' # ' arr [ i + 1 ] [ j ] = ' # ' arr [ i - 1 ] [ j ] = ' # ' f = Truefor i in arr : if ' . ' in i : f = False break     print ( " YES " if f else " NO " ) NEW_LINE


if __name__ == " _ _ main _ _ " : n = int ( input ( ) ) matrix = [ ] supposed_to_be_total = ( n * n ) while n : s = input ( ) matrix . append ( list ( s ) ) n = n - 1 m = len ( matrix ) i = 1 while i < m - 1 : j = 1 while j < m - 1 : if matrix [ i ] [ j ] == ' # ' : count = 0 j = j + 1 continue else : if ( matrix [ i + 1 ] [ j ] == ' . ' ) and ( matrix [ i - 1 ] [ j ] == ' . ' ) and ( matrix [ i ] [ j - 1 ] == ' . ' ) and ( matrix [ i ] [ j + 1 ] == ' . ' ) : matrix [ i + 1 ] [ j ] = ' # ' matrix [ i - 1 ] [ j ] = ' # ' matrix [ i ] [ j - 1 ] = ' # ' matrix [ i ] [ j + 1 ] = ' # ' matrix [ i ] [ j ] = ' # ' j = j + 1 i = i + 1 for i in range ( m ) : if ' . ' in matrix [ i ] : print ( " NO " ) exit ( 0 ) print ( " YES " ) NEW_LINE


import java . util . * ; import java . util . stream . * ;   public class Solution { public static void main ( String [ ] args ) { Scanner scan = new Scanner ( System . in ) ; int n = scan . nextInt ( ) ; scan . nextLine ( ) ; Set < Integer > middle = new HashSet < Integer > ( ) ; Set < Integer > bottom = new HashSet < Integer > ( ) ; String result = " YES " ; for ( int i = 0 ; i < n ; i ++ ) { StringBuilder s = new StringBuilder ( scan . nextLine ( ) ) ; for ( Integer elem : bottom ) { if ( s . charAt ( elem ) == ' . ' ) { s . setCharAt ( elem , ' # ' ) ; } else { result = " NO " ; break ; } } bottom . clear ( ) ;