? nextprime(200)
%1 = 211
? nextprime(300)
%2 = 307
? n=%1*%2
%3 = 64777
? for(a=1,10,e=ellinit(Mod(1,n)*[0,0,0,a,1]);P=Mod(1,n)*[0,1];Q=ellpow(e,P,720);print("a = ",a))
a = 1
a = 2
a = 3
a = 4
a = 5
a = 6
a = 7
a = 8
a = 9
  ***   at top-level: ...a,1]);P=Mod(1,n)*[0,1];Q=ellpow(e,P,720);prin
  ***                                             ^--------------------
  *** ellpow: impossible inverse modulo: Mod(39296, 64777).
  ***   Break loop: type 'break' to go back to GP
break> break

? gcd(39296,64777)
%4 = 307
? \q