Hello! Please write a python program that inputs an odd prime p, and outputs a list

v = (v[0],v[1],...,v[n-1])

of length n = (p-1)/2 whose entries are all of the quadratic residues a modulo p with 1 <= a < p, in increasing order.

For ex:

input p = 7, your program should output the list v = (1,2,4). You can create a legendre_symbol function (recommended).

Please use this program then to find the quadratic residues modulo 17 and also modulo 53.

Please note that sage can be used here instead of python as well.

Thanks!