#include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define BIG 1000000010
#define repi(i,x,n) for(int i=x;i<n;i++)
#define rep(i,n) repi(i,0,n)
#define repn(i,n) for(int i=n;i>=0;i--)
typedef long long int ll;


int main(){
  int n,m;
  pair<int,int> a[60];
  vector<int> ans;
  cin>>n;
  rep(i,n){
    cin>>m;
    a[i]=make_pair(m,i+1);
  }
  sort(a,a+n);
  repn(i,n-1){
    if(a[i].first>1) ans.push_back(a[i].second);
    else break;
  }
  rep(i,n){
    if(a[i].first<0 && a[i].first!= -1){
      if(a[i+1].first<0){
	ans.push_back(a[i].second);
	ans.push_back(a[i+1].second);
	i++;
      }else break;
    }else break;
  }
  sort(ans.begin(),ans.end() );
  cout<<ans.size()<<endl;
  rep(i,ans.size() ){
    cout<<ans[i]<<endl;
  }
      
  

  return 0;
}

