ss

#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
    double a[1001]={0};
    int n=0,t=0,x=0,y=0;
    cin>>t;
    for(int i=0;i<t;i++)cin>>a[i];
    x=a[0];
    for(int i=0;i<t;i++)
    {

        if(x>a[i])
        {
            x=a[i];
            y=i;
        }

    }
    printf("Minimum value: %d\n",x);
    printf("Position: %d\n",y);
    return 0;
}