Help me in solving DSAAGP07 problem

My issue

Wrong Answer: Failed on a hidden test case

My code

#include <stdio.h>

int main() {
    int arra[50],i,n,pos=0,find;
    scanf("%d",&n);
    for(i=0;i<n;i++){
        scanf("%d",&arra[i]);
    }
    scanf("%d%d",&find,&pos);
    for(i=n-1;i>=pos-1;i--){
        arra[i+1]=arra[i];
    }
    arra[pos-1]=find;
    for(i=0;i<=n;i++){
        printf("%d",arra[i]);
    }
    return 0;}

Learning course: BCS301: Data structures
Problem Link: https://www.codechef.com/learn/course/abesit-dsa/ABESITDS05/problems/DSAAGP07