import java.util.*

fun main(args:Array<String>){
    val n = readLine()!!.toInt()
    val uf = UnionFind(n)
    repeat(n - 1){
        val (a,b) = readLine()!!.split(" ").map{it.toInt()}
        uf.unite(a,b)
    }
    val a = uf.find(0)
    var ok = true
    for(i in 0 until n){
        if(uf.find(i) != a) ok = false
    }
    println(if(ok) "Bob" else "Alice")
}

class UnionFind{
    var a = IntArray(0)
    constructor(n : Int){
        this.a = IntArray(n){-1}
    }

    fun unite(x : Int, y : Int) : Boolean{
        var X = find(x)
        var Y = find(y)
        if(X == Y) return false
        if(a[X] > a[Y]){
            val Z = X
            X = Y
            Y = Z
        }
        a[X] += a[Y]
        a[Y] = X
        return true
    }

    tailrec fun find(x : Int) : Int{
        if(a[x] < 0) return x
        a[x] = find(a[x])
        return a[x]
    }

    fun size(x : Int) : Int{
        return -a[find(x)]
    }
}