/**
 * Given a list of points (x, y) in a coordinate plane, find the first point where the sum of its coordinates is divisible
 * by 5. If such a point exists, return it; otherwise, return null.
 *
 * Use break and continue statements to optimize the search process.
 *
 * @param points List of points in a coordinate plane
 * @return The first point where the sum of its coordinates is divisible by 5, or null if no such point exists
 */
fun tupleBreakContinue(points: List<Pair<Int, Int>>): Pair<Int, Int>? {

    for (point in points) {
        if ((point.first + point.second) % 5 == 0) {
            return point
        } else if ((point.first + point.second) % 5 != 0) {
            continue
        } else {
            break
        }
    }
    return null
}
/**
 * Given a list of points (x, y) in a coordinate plane, find the first point where the sum of its coordinates is divisible
 * by 5. If such a point exists, return it; otherwise, return null.
 *
 * Use break and continue statements to optimize the search process.
 *
 * @param points List of points in a coordinate plane
 * @return The first point where the sum of its coordinates is divisible by 5, or null if no such point exists
 */
fun tupleBreakContinue(points: List<Pair<Int, Int>>): Pair<Int, Int>? {
/**
 * Given a list of points (x, y) in a coordinate plane, find the first point where the sum of its coordinates is divisible
 * by 5. If such a point exists, return it; otherwise, return null.
 *
 * Use break and continue statements to optimize the search process.
 *
 * @param points List of points in a coordinate plane
 * @return The first point where the sum of its coordinates is divisible by 5, or null if no such point exists
 */
fun tupleBreakContinue(points: List<Pair<Int, Int>>): Pair<Int, Int>? {

    for (point in points) {
        if ((point.first + point.second) % 5 == 0) {
            return point
        } else if ((point.first + point.second) % 5 != 0) {
            continue
        } else {
            break
        }
    }
    return null
}