//set 1
//prob 1
#include <iostream>

using  namespace std;
int c[1001];
int main()
{
    int n; cin>>n;
    for (int i=1; i<=n; ++i)
        cin>>c[i];
    int s;
    for (int i=1; i<=n; ++i)
    {
        for (int j=1; j<=i; ++j)
        {
            s=0;
            for (int k=j; k<=i; ++k)
                s+=c[k];
            if (s%n==0)
            {
                for (int k=j; k<=i; ++k)
                    cout<<k<<" ";
                return 0;
            }
        }
    }
    return 0;
}
//prob 2
#include <iostream>
#include <algorithm>
using namespace std;
int v[1001], r[1001];
int main()
{
    int n;
    cin>>n;
    for (int i=1; i<=n; ++i)
        cin>>v[i];
    sort (v+1, v+n+1);
    int k=0;
    for (int i=1, j=n; i<=j; ++i, --j)
    {
        r[++k]=v[i];
        r[++k]=v[j];
    }
    for (int i=1; i<=k; ++i)
        cout<<r[i]<<' ';

    return 0;
}