package main

import (
    "fmt"
    "math"
    "sort"
    "strconv"
    "strings"
)

type Nums struct {
    element string
    pow     float64
}

type Elements []Nums

func (e Elements) Len() int {
    return len(e)
}

func (e Elements) Less(i, j int) bool {
    return e[i].pow < e[j].pow
}

func (e Elements) Swap(i, j int) {
    e[i], e[j] = e[j], e[i]
}

func main() {
    var elements Elements

    var step int
    fmt.Scan(&step)

    for i := 0; i < step; i++ {
        var data string
        fmt.Scan(&data)
        s := Nums{element: data, pow: 0}
        ss := powing(s)
        elements = append(elements, ss)
    }
    //fmt.Printf("%+v\n", elements)

    sort.Sort(elements)
    fmt.Println("Case 1:")
    for i := 0; i < len(elements); i++ {
        fmt.Println(elements[i].element)
    }
}

func powing(data Nums) Nums {
    if strings.Contains(data.element, "^") {
        nums_string := strings.Split(data.element, "^")
        var nums = []float64{}

        for i := 0; i < len(nums_string); i++ {
            szam, err := strconv.ParseFloat(nums_string[i], 64)
            if err != nil {
                fmt.Println("kurva")
            }
            nums = append(nums, szam)
        }
        for i := 0; i < len(nums); i++ {
            if data.pow == 0 {
                data.pow = math.Pow(nums[i], nums[i+1])
            } else {
                if i != len(nums)-1 {
                    data.pow = math.Pow(data.pow, nums[i+1])
                }

            }
        }
        return data
    } else {
        nume, _ := strconv.ParseFloat(data.element, 64)
        data.pow = nume
        return data
    }
}