The program satisfies and gives the right answer for the test cases, But when I submit it gives a runtime error. I know this is not the efficient code for the problem but still I just want to know the error in it

this is the program i submitted for the ODD prob whose link I have mentioned below. It ll be of great help and motivation if I am able to find out the error in this code.

```
#include<stdio.h>
#define SIZE 100000
int main()
{
int t,a,i,j,c,d;
unsigned long n[SIZE],test,testin[SIZE],testout[SIZE];
scanf("%d",&test);
for(t=0;t<test;t++)
{
scanf("%d",&testin[t]);
for(j=0;j<testin[t];j++)
n[j]=j+1;
path:
d=0;
c=2;
for(j=0;j<testin[t];j++)
{
if(n[j]!=0)
{
if(c%2==0)
{
n[j]=0;
}
c++;
}
}
for(j=0;j<testin[t];j++)
{
if(n[j]!=0)
d++;
}
if(d==1)
{
for(i=0;i<testin[t];i++)
{
if(n[i]!=0)
testout[t]=n[i];
}
}
else
goto path;
}
for(t=0;t<test;t++)
printf("%d\n",testout[t]);
return 0;
}
```