CKANG

def solution(n):
    answer = []
    for i in range(2,n+1):
        pre = 0
        while pre != n:
            pre = n
            if n%i==0:
                if not i in answer:
                    answer.append(i)
                n = n//i
        if n==1:
            break
    
    return answer

def solution(board):
    answer = []
    
    for i in board:
        answer.append(list(i))
        
    
    for i, r in enumerate(board):
        for j, v in enumerate(r):
            if v==1:
                for q in range(i-1,i+2):
                    for r in range(j-1,j+2):                        
                        if 0<=q and q <len(board) and 0<=r and r < len(board[0]):
                            answer[q][r] = 1
    
    answer = len(board) * len(board[0]) - sum(list(map(sum,answer)))
    
    return answer

def solution(n):
    
    answer = [[0]*n for i in range(n)]
    
    
    x, y = 0, 0
    move_state = 0#right==0, down = 1, left=2, up=3 
    
    for i in range(1,(n*n)+1):
        answer[y][x] = i
        
        if move_state == 0: x+=1
        elif move_state == 1: y+=1
        elif move_state == 2: x-=1
        elif move_state == 3: y-=1
        
        if (move_state==0 and (x+1 >= n or  answer[y][x+1]!=0)) or (move_state==1 and (y+1 >= n or  answer[y+1][x]!=0)) or (move_state==2 and (x-1 < 0 or  answer[y][x-1]!=0)) or (move_state==3 and (y-1 < 0 or  answer[y-1][x]!=0)):
            move_state =(move_state+1)%4
            
            
        
    return answer