Tokiyomi

# Solve Sum in Python

def solve_sum(A, B):
    """
    This function implements a greedy approach to minimize the sum difference
    among two sets A and B
    """
    C = sorted(A + B, reverse=True) # Join both subsets and sort them in reversed order
    a_sum = 0
    b_sum = 0

Tokiyomi

# Main in python

def main():

    T = int(input())

    for t in range(T):
        N = int(input()) # Read N 
        if N==-1:
            break

Tokiyomi

// Main in Kotlin

fun main() {
  
  val T:Int  = readln().toInt(); // Read number of cases

  for (t in 0..T-1) {
        var N:Int  =  readln().toInt(); // Read N int
        if (N == -1) {
          break