def count_no_of_ways(n, k):
    if n == 0:
        return 0
    if n == 1:
        return k
    if n == 2:
        return k * k
    
    same = k
    diff = k * (k - 1)
    
    for i in range(3, n + 1):
        prev_same = same
        prev_diff = diff
        same = prev_diff
        diff = (prev_same + prev_diff) * (k - 1)
    
    return same + diff