Script Code To Return 2 Primes That Sum To First Argument

n=argument0;p[0]=2;repeat n div 2-1{p[1]=n-p[0];i=0;repeat 2{d[i]=2;while(p[i]%d[i]!=0)d[i]++;i++;}if d[0]=p[0]&&d[1]=p[1]return p;p[0]++;}