//  Created by conan1024hao in 2019.
//  Copyright © 2019 conan1024hao. All rights reserved.
//  専用ライブラリです、自由にコピーして構いません。
//  感谢看我的代码！Wechat:conan1024hao Twitter/QQ:810396815
#pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <utility>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <string>
#include <ctime>
#include <cctype>
#include <cstdlib>
#define IINF 10e8
#define INF 10e16
#define MOD 1000000007
#define mod 1000000007
#define rep(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define Endl endl
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define mmax(x,y)(x>y?x:y)
#define mmin(x,y)(x<y?x:y)
#define chmax(x,y) x=mmax(x,y)
#define chmin(x,y) x=mmin(x,y)
#define all(x) (x).begin(),(x).end()
#define siz(x) (ll)(x).size()
#define PI acos(-1.0)
using namespace std;
//using Int=int_fast64_t;
typedef long long int ll;
typedef pair<ll,ll>Pll;
typedef pair<int,int>Pin;
long long GCD(long long a, long long b) { return b ? GCD(b, a%b) : a; }
long long LCM(long long a, long long b)  {return a/GCD(a,b)*b;}
int dx[8]={-1,0,1,0,1,1,-1,-1};
int dy[8]={0,-1,0,1,1,-1,1,-1};
char dir[4]={'u','l','d','r'};
ll cmp1(pair<ll,string>a,pair<ll,string> b){
        if(a.fi!=b.fi)
        return a.fi<b.fi;
        else
        return a.se<b.se;
}

//---------------------------------------------------------------------------
int ccount=0;

void merge(int arr[],int first,int mid,int last)
{
     
    int *tmpArr=new int[last-first+1];
    int i=first,j=mid+1;
    int cur=0;
    while(i<=mid && j<=last)
    {
        if(arr[i]<arr[j])
        {
            tmpArr[cur++]=arr[i++];
        }
        else
        {
            tmpArr[cur++]=arr[j++];

            ccount += mid-i+1;//只增加这一句便可求逆序数
        }
    }
    if(i<=mid)
    {
        while(i<=mid)
            tmpArr[cur++]=arr[i++];
    }
    else
    {
        while(j<=last)
            tmpArr[cur++]=arr[j++];
    }
 

    for(int k=0;k<cur;k++)
    {
        arr[first++]=tmpArr[k];
    }
    delete[] tmpArr;
    tmpArr=NULL;
}



void mergeSort(int arr[],int first,int last)
{
    if(first==last)
        return;
    int mid=(first+last)/2;
    mergeSort(arr,first,mid);
    mergeSort(arr,mid+1,last);
    merge(arr,first,mid,last);
}
//---------------------------------------------------------------------------
int main(){//問題をちゃんと見ろ!!!!!!!!!!!!!!!!!      llか??????????统一类型        memset()!!!!!!!!!!!!       ペナを減らせ!!!!!!!!!!!!!
    cin.tie(0);
    ios::sync_with_stdio(false);
    //-------------------------------
    int n;cin>>n;
    vector<int>p(n);
    for(int i=0;i<n;i++)
        cin>>p[i];
    int ans=1;
    int minp=p[0];
    for(int i=1;i<n;i++){
        if(p[i]<=minp){
            //cout<<i<<endl;
            ans++;
        }
            
        chmin(minp,p[i]);
    }
    cout<<ans<<endl;
    //-------------------------------
    return 0;
}
//---------------------------------------------------------------------------






Measured memory_bytes: 1024