Заполнить матрицу по спирали

n = int(input())
my_lst = []
for i in range((n**2)+1):
    if i > 0:
        my_lst.append(i)
qube = []
for a in range(n+1):
    row_lst = []
    row_lst.append(my_lst[a])

    if i<=j+1 and i+j<n-1: 
        j+=1
    elif i<j and i+j>=n-1: 
        i+=1
    elif i>=j and i+j>n-1: 
        j-=1
    elif i>j+1 and i+j<=n-1: 
        i-=1

r = 3
c = 7
 
mas = [[0]*c for _ in range(r)]
 
i = 0
j = 0
 
num = 1
 
right = True
down = False
left = False
up = False
 
def zero(mas):
    for row in mas:
        if 0 in row:
            return True
    return False
 
while zero(mas):
    if mas[i][j] == 0:
        mas[i][j] = num
        num += 1
 
    if j < c-1 and mas[i][j+1] == 0 and right:
        j += 1
 
    elif i < r-1 and mas[i+1][j] == 0 and down:
        i += 1
 
    elif j >= 0 and mas[i][j-1] == 0 and left:
        j -= 1
 
    elif i >= 0 and mas[i-1][j] == 0 and up:
        i -= 1
    elif right:
        right = False
        down = True
 
    elif down:
        down = False
        left = True
 
    elif left:
        left = False
        up = True
 
    elif up:
        up = False
        right = True
 
for row in mas:
    print(row)

from itertools import cycle
n = 5
 
 
directions = ((1, 0), (0, -1), (-1, 0), (0, 1))
 
nums = range(1, n*n+1)
 
def length_producer(_max):
    curr_l = _max
    while curr_l > 0:
        yield curr_l
        curr_l -=1
        yield curr_l
 
 
print(list(length_producer(n)), sum(list(length_producer(n))))
 
buffer = []
for i in range(n):
    buffer.append([None]*n)
 
print(buffer)
 
curr_i, curr_j = -1, n-1
 
values_iterator = iter(nums)
 
for l, d in zip(length_producer(n), cycle(directions)):
    print(l, d)
    for i in range(l):
        num = next(values_iterator)
        curr_i += d[0]
        curr_j += d[1]
        buffer[curr_i][curr_j] = num
 
for line in buffer:
    print(line)

while num < c*r + 1:
    ...