import java.io.*;
import java.io.InputStreamReader;
import java.util.Scanner;
import java.util.StringTokenizer;
import java.util.*;
import java.math.*;
public class Main
{
    static class FastReader
    {
        BufferedReader br;
        StringTokenizer st;

        public FastReader()
        {
            br = new BufferedReader(new
                     InputStreamReader(System.in));
        }

        String next()
        {
            while (st == null || !st.hasMoreElements())
            {
                try
                {
                    st = new StringTokenizer(br.readLine());
                }
                catch (IOException  e)
                {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt()
        {
            return Integer.parseInt(next());
        }

        long nextLong()
        {
            return Long.parseLong(next());
        }

        double nextDouble()
        {
            return Double.parseDouble(next());
        }

        String nextLine()
        {
            String str = "";
            try
            {
                str = br.readLine();
            }
            catch (IOException e)
            {
                e.printStackTrace();
            }
            return str;
        }
    }
     public static void main (String[] args) throws java.lang.Exception {
        FastReader sc=new FastReader();
        PrintWriter pw=new PrintWriter(System.out);
    	int t=sc.nextInt();
    	while(t-->0)
        {
           long n=sc.nextLong(),m=sc.nextLong(),k=0,d=m;
           while(m>0)
           {
             k++;
             m/=10;
           }
           String s=String.valueOf(d);
           if(s.indexOf('9')==0 && s.lastIndexOf('9')==s.length()-1)
           k++;
           long p=n*(k-1);
           pw.println(p);
        }
    pw.close();
    }
}


import java.io.*;
import java.io.InputStreamReader;
import java.util.Scanner;
import java.util.StringTokenizer;
import java.util.*;
import java.math.*;
public class Main
{
    static class FastReader
    {
        BufferedReader br;
        StringTokenizer st;

        public FastReader()
        {
            br = new BufferedReader(new
                     InputStreamReader(System.in));
        }

        String next()
        {
            while (st == null || !st.hasMoreElements())
            {
                try
                {
                    st = new StringTokenizer(br.readLine());
                }
                catch (IOException  e)
                {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt()
        {
            return Integer.parseInt(next());
        }

        long nextLong()
        {
            return Long.parseLong(next());
        }

        double nextDouble()
        {
            return Double.parseDouble(next());
        }

        String nextLine()
        {
            String str = "";
            try
            {
                str = br.readLine();
            }
            catch (IOException e)
            {
                e.printStackTrace();
            }
            return str;
        }
    }
     public static void main (String[] args) throws java.lang.Exception {
        FastReader sc=new FastReader();
        PrintWriter pw=new PrintWriter(System.out);
    	int t=sc.nextInt();
    	while(t-->0){
           long n=sc.nextLong(),m=sc.nextLong(),k=0,d=m;
           while(m>0)
           {
             k++;
             m/=10;
           }
           if(k==1)
           {
           if(d==9)
           pw.println(n);
           else pw.println(0);
           }
           else
           {
           long p=n*(k-1);
           pw.println(p);
           }
        }
    pw.close();
    }
}


import java.util.*;

import java.io.*;
public class d_educational {

	public static boolean isPowerofTen(long n)
	{
		if(n == 1)
			return true;
		long res = 1;

		while(res < n)
		{
			res *= 10l;
		}

		return res == n;

	}

	public static int llog(long n)
	{
		int cnt = 0;

		n/=10l;

		while(n > 0)
		{
			n/=10;
			cnt++;
		}

		return cnt;
	}

	public static void main(String[] args)throws IOException{

		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		PrintWriter out = new PrintWriter(System.out);

		int t = Integer.parseInt(br.readLine());
		while(t-- > 0)
		{
			StringTokenizer st1 = new StringTokenizer(br.readLine());
			long a = Long.parseLong(st1.nextToken());
			long b = Long.parseLong(st1.nextToken());
			long nn = llog(b+1l);

			out.println(nn*a);

		}

		out.flush();
		out.close();
	}

	static class triple implements Comparable{
		int x,y;
		public triple(int x , int y)
		{
			this.x = x;
			this.y = y;

		}
		@Override
		public int compareTo(Object o) {
			triple p = (triple)o;

			if(this.y > p.y)
				return 1;
			if(this.y < p.y)
				return -1;if(this.x > p.x)
				return 1;
			if(this.x < p.x)
				return -1;

			return 0;

		}
		public String toString()
		{
			return "("+ this.x + "," + this.y+")";
		}

	}

}


import java.util.*;

import java.io.*;
public class d_educational {

	public static boolean isPowerofTen(long n)
	{
		if(n == 1)
			return true;
		long res = 1;

		while(res < n)
		{
			res *= 10l;
		}

		return res == n;

	}

	public static void main(String[] args)throws IOException{

		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		PrintWriter out = new PrintWriter(System.out);

		int t = Integer.parseInt(br.readLine());
		while(t-- > 0)
		{
			StringTokenizer st1 = new StringTokenizer(br.readLine());
			long a = Long.parseLong(st1.nextToken());
			long b = Long.parseLong(st1.nextToken());
			long nn = (long)(Math.log(b*1.0)/Math.log(10.0));
			if(isPowerofTen(b+1))
			{
				out.println(nn*a+1);
			}
			else
			{
				out.println(nn*a);
			}
		}

		out.flush();
		out.close();
	}

	static class triple implements Comparable{
		int x,y;
		public triple(int x , int y)
		{
			this.x = x;
			this.y = y;

		}
		@Override
		public int compareTo(Object o) {
			triple p = (triple)o;

			if(this.y > p.y)
				return 1;
			if(this.y < p.y)
				return -1;if(this.x > p.x)
				return 1;
			if(this.x < p.x)
				return -1;

			return 0;

		}
		public String toString()
		{
			return "("+ this.x + "," + this.y+")";
		}

	}

}


import java.util.*;

import java.io.*;
public class d_educational {

	public static boolean isPowerofTen(long n)
	{
		if(n == 1)
			return true;
		long res = 1;

		while(res < n)
		{
			res *= 10l;
		}

		return res == n;

	}

	public static void main(String[] args)throws IOException{

		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		PrintWriter out = new PrintWriter(System.out);

		int t = Integer.parseInt(br.readLine());
		while(t-- > 0)
		{
			StringTokenizer st1 = new StringTokenizer(br.readLine());
			long a = Long.parseLong(st1.nextToken());
			long b = Long.parseLong(st1.nextToken());
			long nn = (long)(Math.log(b*1.0+1.0)/Math.log(10.0));

			out.println(nn*a);

		}

		out.flush();
		out.close();
	}

	static class triple implements Comparable{
		int x,y;
		public triple(int x , int y)
		{
			this.x = x;
			this.y = y;

		}
		@Override
		public int compareTo(Object o) {
			triple p = (triple)o;

			if(this.y > p.y)
				return 1;
			if(this.y < p.y)
				return -1;if(this.x > p.x)
				return 1;
			if(this.x < p.x)
				return -1;

			return 0;

		}
		public String toString()
		{
			return "("+ this.x + "," + this.y+")";
		}

	}

}


import java.util.Scanner;

public class Test {

	public static void main(String[] args) {

		Scanner input = new Scanner(System.in);

		//inputs
		int t = input.nextInt();
		for(int i = 0 ; i < t ; i++){
		int A = input.nextInt();
		int B = input.nextInt();

		String s = String.valueOf(B);
		String nines = "";
		for(int j = 0 ; j < s.length() ; j++)
			nines += 9;

		System.out.println(B >= Integer.parseInt(nines) ? nines.length() * A : (nines.length() - 1)  * A);

		}
	}

}


import java.util.Scanner;

public class Test {

	public static void main(String[] args) {

		Scanner input = new Scanner(System.in);

		//inputs
		int t = input.nextInt();
		for(int i = 0 ; i < t ; i++){
		long A = input.nextInt();
		long B = input.nextInt();

		String s = String.valueOf(B);
		String nines = "";
		for(int j = 0 ; j < s.length() ; j++)
			nines += 9;

		System.out.println(B >= Long.parseLong(nines) ? nines.length() * A : (nines.length() - 1)  * A);

		}
	}

}


import java.util.Scanner;

public class Test {

	public static void main(String[] args) {

		Scanner input = new Scanner(System.in);

		//inputs
		int t = input.nextInt();
		for(int i = 0 ; i < t ; i++){
		long A = input.nextInt();
		long B = input.nextInt();

		String s = B+"";
		String nines = "";
		for(int j = 0 ; j < s.length() ; j++)
			nines += 9;

		System.out.println(B >= Long.parseLong(nines) ? nines.length() * A : (nines.length() - 1)  * A);

		}
	}

}


import javax.management.DynamicMBean;
import javax.print.DocFlavor;
import javax.print.attribute.HashAttributeSet;
import java.awt.*;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.nio.file.attribute.FileAttribute;
import java.util.List;
import java.util.Scanner;
import java.util.StringTokenizer;
import java.util.*;
import java.util.Arrays;
import java.util.concurrent.Callable;

public class Main {

    static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        public FastReader() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }

    public static void main(String[] args) {
        FastReader sc = new FastReader();
       int t=sc.nextInt();
       for(int i=0;i<t;i++){
           int a=sc.nextInt();
           int b=sc.nextInt();
           int count=0;
           String s="";

           for(int j=1;j<=9;j++){
               s+="9";
            if(Integer.parseInt(s)<=b){
                count++;
            }
           }

           long ans=count*a;
           System.out.println(ans);
       }

    }

}


import javax.management.DynamicMBean;
import javax.print.DocFlavor;
import javax.print.attribute.HashAttributeSet;
import java.awt.*;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.nio.file.attribute.FileAttribute;
import java.util.List;
import java.util.Scanner;
import java.util.StringTokenizer;
import java.util.*;
import java.util.Arrays;
import java.util.concurrent.Callable;

public class Main {

    static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        public FastReader() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }

    public static void main(String[] args) {
        FastReader sc = new FastReader();
       int t=sc.nextInt();
       for(int i=0;i<t;i++){
           int a=sc.nextInt();
           int b=sc.nextInt();
           int count=0;
           for(int j=1;j<=9;j++){
            if(Math.pow(10,j)<=b){
                count++;
            }
           }
           String s=String.valueOf(b);
           s=s.replace("9","");
           if(s.isEmpty()){
               count++;
           }
           long ans=count*a;
           System.out.println(ans);
       }

    }

}


import javax.management.DynamicMBean;
import javax.print.DocFlavor;
import javax.print.attribute.HashAttributeSet;
import java.awt.*;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.nio.file.attribute.FileAttribute;
import java.util.List;
import java.util.Scanner;
import java.util.StringTokenizer;
import java.util.*;
import java.util.Arrays;
import java.util.concurrent.Callable;

public class Main {

    static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        public FastReader() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }

    public static void main(String[] args) {
        FastReader sc = new FastReader();
       int t=sc.nextInt();
       for(int i=0;i<t;i++){
           int a=sc.nextInt();
           int b=sc.nextInt();
           int count=0;
           String s="";

           for(int j=1;j<=9;j++){
               s+="9";
            if(Integer.parseInt(s)<=b){
                count++;
            }
           }

           long ans=(long)count*a;
           System.out.println(ans);
       }

    }

}


import javax.management.DynamicMBean;
import javax.print.DocFlavor;
import javax.print.attribute.HashAttributeSet;
import java.awt.*;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.nio.file.attribute.FileAttribute;
import java.util.List;
import java.util.Scanner;
import java.util.StringTokenizer;
import java.util.*;
import java.util.Arrays;
import java.util.concurrent.Callable;

public class Main {

    static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        public FastReader() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }

    public static void main(String[] args) {
        FastReader sc = new FastReader();
       int t=sc.nextInt();
       for(int i=0;i<t;i++){
           int a=sc.nextInt();
           int b=sc.nextInt();
           int count=0;
           for(int j=1;j<=9;j++){
            if((int)Math.pow(10,j)<=b){
                count++;
            }
           }
           String s=String.valueOf(b);
           s=s.replace("9","");
           if(s.isEmpty()){
               count++;
           }
           long ans=count*a;
           System.out.println(ans);
       }

    }

}


import javax.management.DynamicMBean;
import javax.print.DocFlavor;
import javax.print.attribute.HashAttributeSet;
import java.awt.*;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.nio.file.attribute.FileAttribute;
import java.util.List;
import java.util.Scanner;
import java.util.StringTokenizer;
import java.util.*;
import java.util.Arrays;
import java.util.concurrent.Callable;

public class Main {

    static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        public FastReader() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }

    public static void main(String[] args) {
        FastReader sc = new FastReader();
       int t=sc.nextInt();
       for(int i=0;i<t;i++){
           int a=sc.nextInt();
           int b=sc.nextInt();
           int count=0;
           for(int j=1;j<=9;j++){
            if(Math.pow(10,j)<=b){
                count++;
            }
           }
           String s=String.valueOf(b);
           s=s.replace("9","");
           if(s.isEmpty()){
               count++;
           }import javax.management.DynamicMBean;
import javax.print.DocFlavor;
import javax.print.attribute.HashAttributeSet;
import java.awt.*;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.nio.file.attribute.FileAttribute;
import java.util.List;
import java.util.Scanner;
import java.util.StringTokenizer;
import java.util.*;
import java.util.Arrays;
import java.util.concurrent.Callable;

public class Main {

    static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        public FastReader() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }

    public static void main(String[] args) {
        FastReader sc = new FastReader();
       int t=sc.nextInt();
       for(int i=0;i<t;i++){
           int a=sc.nextInt();
           int b=sc.nextInt();
           int count=0;
           for(int j=1;j<=9;j++){
            if((int)Math.pow(10,j)<=b){
                count++;
            }
           }
           String s=String.valueOf(b);
           s=s.replace("9","");
           if(s.isEmpty()){
               count++;
           }
           long ans=count*a;
           System.out.println(ans);
       }

    }

}

           long ans=count*a;
           System.out.println(ans);
       }

    }

}


import java.util.Scanner;

public class YetAnotherMemeProblem {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int t = sc.nextInt();
        while (t-- > 0) {
            int a = sc.nextInt(), b = sc.nextInt();
            int num = 0;
            int k = 0;
            int cnt = 0;
            while(num <= b){
                num += Math.pow(10, k) * 9;
                if(num > b)
                    break;
                k += 1;
                cnt += 1;
            }
            System.out.println(cnt * a);
        }
    }
}


import java.util.Scanner;

public class YetAnotherMemeProblem {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int t = sc.nextInt();
        while (t-- > 0) {
            long a = sc.nextInt(), b = sc.nextInt();
            System.out.println(a*(int)Math.log10(b+1));
//            int num = 0;
//            int k = 0;
//            int cnt = 0;
//            while(num <= b){
//                num += Math.pow(10, k) * 9;
//                if(num > b)
//                    break;
//                k += 1;
//                cnt += 1;
//                System.out.println(num);
//            }
//            System.out.println(cnt);
        }
    }
}


import java.util.Scanner;

public class YetAnotherMemeProblem {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int t = sc.nextInt();
        while (t-- > 0) {
            long a = sc.nextInt(), b = sc.nextInt();
            long num = 0;
            int k = 0;
            int cnt = 0;
            while(num <= b){
                num += (long) Math.pow(10, k) * 9;
                if(num > b)
                    break;
                k += 1;
                cnt += 1;
            }
            System.out.println(cnt * a);
        }
    }
}


import java.util.Arrays;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n=sc.nextInt();
        int[] arr=new int[n];
        for(int t=0;t<n;t++){

            arr[t]=sc.nextInt();
        }
        int f=0;
        int[] big=new int[200];
        for(int t=0;t<n-1;t++){
            if(arr[t]<=arr[t+1]){
                big[f]++;
               // System.out.print("++  "+big[f]);
               }else f++;
            }
        Arrays.sort(big);
        System.out.print(big[199]+1);

        }
    }


import java.util.Arrays;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n=sc.nextInt();
        int[] arr=new int[n];
        for(int t=0;t<n;t++){

            arr[t]=sc.nextInt();
        }
        int f=0;
        int[] big=new int[200];
        for(int t=0;t<n-1;t++){
            if(arr[t]<=arr[t+1]){
                big[f]++;
               // System.out.print("++  "+big[f]);
               }else f++;
            }
        Arrays.sort(big);
        System.out.print(big[39]+1);

        }
    }


import java.util.Arrays;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n=sc.nextInt();
        int[] arr=new int[n];
        for(int t=0;t<n;t++){

            arr[t]=sc.nextInt();
        }
        int f=0;
        int[] big=new int[n];
        for(int t=0;t<n-1;t++){
            if(arr[t]<=arr[t+1]){
                big[f]++;
               // System.out.print("++  "+big[f]);
               }else f++;
            }
        Arrays.sort(big);
        System.out.print(big[n-1]+1);

        }
    }


import java.util.Scanner;
import java.lang.Math;

public class Main
{
	public static void main(String[] args) {

	    Scanner cin= new Scanner (System.in);
	    int n;
	    int [] a=new int[10000];

	    n=cin.nextInt();
	    int sum=1,m=1;
	  for (int i=0;i<n;i++)
	  {
	       a[i]=cin.nextInt();
	  }
	  for (int i=0;i<n-1;i++)
	  {
	      if (a[i]<=a[i+1]){
	      sum++;

}
else
sum=1;
m=Math.max(m,sum);
	  }

    	System.out.println(m);

	}
}


import java.util.Scanner;
import java.lang.Math;

public class Main
{
	public static void main(String[] args) {

	    Scanner cin= new Scanner (System.in);
	    int n;
	    int [] a=new int[100000];

	    n=cin.nextInt();
	    int sum=1,m=1;
	  for (int i=0;i<n;i++)
	  {
	       a[i]=cin.nextInt();
	  }
	  for (int i=0;i<n-1;i++)
	  {
	      if (a[i]<=a[i+1]){
	      sum++;

}
else
sum=1;
m=Math.max(m,sum);
	  }

    	System.out.println(m);

	}
}


import java.util.Scanner;
import java.lang.Math;

public class Main
{
	public static void main(String[] args) {

	    Scanner cin= new Scanner (System.in);
	    int n;
	    int [] a=new int[1000];
	    int c=0,f=0;
	    n=cin.nextInt();
	    int sum=0,m=0;
	  for (int i=0;i<n;i++)
	  {
	       a[i]=cin.nextInt();
	  }
	  for (int i=0;i<n;i++)
	  {
	      if (a[i]<=a[i+1])
	      sum++;
	  }
	  m=Math.max(m,sum);

    	System.out.println(m);

	}
}


import java.util.Scanner;
import java.lang.Math;

public class Main
{
	public static void main(String[] args) {

	    Scanner cin= new Scanner (System.in);
	    int n;
	    int [] a=new int[100000000];

	    n=cin.nextInt();
	    int sum=1,m=1;
	  for (int i=0;i<n;i++)
	  {
	       a[i]=cin.nextInt();
	  }
	  for (int i=0;i<n-1;i++)
	  {
	      if (a[i]<=a[i+1]){
	      sum++;

}
else
sum=1;
m=Math.max(m,sum);
	  }

    	System.out.println(m);

	}
}


import java.util.Scanner;
import java.lang.Math;

public class Main
{
	public static void main(String[] args) {

	    Scanner cin= new Scanner (System.in);
	    int n;
	    int [] a=new int[n];

	    n=cin.nextInt();
	    int sum=1,m=1;
	  for (int i=0;i<a.length;i++)
	  {
	       a[i]=cin.nextInt();
	  }
	  for (int i=0;i<n-1;i++)
	  {
	      if (a[i]<=a[i+1]){
	      sum++;

}
else
sum=1;
m=Math.max(m,sum);
	  }

    	System.out.println(m);

	}
}


import java.util.Scanner;
import java.lang.Math;

public class Main
{
	public static void main(String[] args) {

	    Scanner cin= new Scanner (System.in);
	    int n;
	    int [] a=new int[100];

	    n=cin.nextInt();
	    int sum=1,m=1;
	  for (int i=0;i<n;i++)
	  {
	       a[i]=cin.nextInt();
	  }
	  for (int i=0;i<n-1;i++)
	  {
	      if (a[i]<=a[i+1]){
	      sum++;

}
else
sum=1;
m=Math.max(m,sum);
	  }

    	System.out.println(m);

	}
}


import java.util.Scanner;
import java.lang.Math;

public class Main
{
	public static void main(String[] args) {

	    Scanner cin= new Scanner (System.in);
	    int n;
	    int [] a=new int[n];

	    n=cin.nextInt();
	    int sum=1,m=1;
	  for (int i=0;i<n;i++)
	  {
	       a[i]=cin.nextInt();
	  }
	  for (int i=0;i<n-1;i++)
	  {
	      if (a[i]<=a[i+1]){
	      sum++;

}
else
sum=1;
m=Math.max(m,sum);
	  }

    	System.out.println(m);

	}
}


import java.util.*;

public class StepsMenor{

    public static int solve(int size, int[] numeros){
        int max = Integer.MIN_VALUE;
        int aux = 0;
        int cont = 0;
        for (int i = 0; i < size-1; i++){

            if (numeros[i] >= max){
                max = numeros[i];
                aux = aux + 1;
            }else{
                aux = 1;
                max = numeros[i];
            }

            if (aux >= cont ){
                cont = aux;
            }
        }

        return cont;
    }

    public static void main(String args[]){
        Scanner res = new Scanner(System.in);
        int size = res.nextInt();
        int [] numeros = new int [size];

        for (int i = 0; i < size; i++){
            int number = res.nextInt();
            numeros[i] = number;
        }

        System.out.println(solve(size, numeros));

        res.close();

    }
}


import java.util.*;

public class StepsMenor{

    public static int solve(int size, int[] numeros){
        int max = Integer.MIN_VALUE;
        int aux = 0;
        int cont = 0;
        for (int i = 0; i < size-1; i++){

            if (numeros[i] >= max){
                max = numeros[i];
                aux = aux + 1;
            }else{
                aux = 1;
                max = numeros[i];
            }

            if (aux >= cont ){
                cont = aux;
            }
        }

        if(numeros[size - 2 ] <= numeros[size-1]){
            return cont +1 ;
        }
        return cont;
    }

    public static void main(String args[]){
        Scanner res = new Scanner(System.in);
        int size = res.nextInt();
        int [] numeros = new int [size];

        for (int i = 0; i < size; i++){
            int number = res.nextInt();
            numeros[i] = number;
        }

        System.out.println(solve(size, numeros));

        res.close();

    }
}


import java.util.*;

public class StepsMenor{

    public static int solve(int size, int[] numeros){
        int max = Integer.MIN_VALUE;
        int aux = 1;
        int cont = 0;
        for (int i = 0; i < size-1; i++){

            if (numeros[i] >= max){
                max = numeros[i];
                aux = aux + 1;
            }else{
                aux = 1;
                max = numeros[i];
            }

            if (aux >= cont ){
                cont = aux;
            }
        }

        return cont;
    }

    public static void main(String args[]){
        Scanner res = new Scanner(System.in);
        int size = res.nextInt();
        int [] numeros = new int [size];

        for (int i = 0; i < size; i++){
            int number = res.nextInt();
            numeros[i] = number;
        }

        System.out.println(solve(size, numeros));

        res.close();

    }
}


import java.util.*;

public class StepsMenor{

    public static int solve(int size, int[] numeros){
        int aux = 0;
        int cont = 0;
        for (int i = 0; i < size-1; i++){

            if (numeros[i] <= numeros[i+1]){
                aux = aux + 1;
            }else{
                aux = 0;
            }

            if (aux >= cont ){
                cont = aux;
            }
        }

        //if(numeros[size - 2 ] <= numeros[size-1]){
        //    return cont +1
        //}
        return cont+1;
    }

    public static void main(String args[]){
        Scanner res = new Scanner(System.in);
        int size = res.nextInt();
        int [] numeros = new int [size];

        for (int i = 0; i < size; i++){
            int number = res.nextInt();
            numeros[i] = number;
        }

        System.out.println(solve(size, numeros));

        res.close();

    }
}


import java.util.*;
public class proplem{
	public static void main(String args[]){
		Scanner s= new Scanner(System.in);
		int a=s.nextInt();
		int c=1,max=0;
		int num[]=new int[a];

		for(int i=0;i<a;i++)
		{
			num[i]=s.nextInt();
		}

		for(int i=0;i<a-1;i++)
		{
			if(num[i]<=num[i+1])
				c++;
			else {
				if(c>max)
				max=c;
				c=1;
			}
		}
		if(c>max)
			max=c;
		System.out.print(max);
}
}


import java.util.*;
public class task {
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] arr = new int[n];
        for(int i = 0;i < n;i++){
            arr[i] = sc.nextInt();
        }
        int max = 0;

        for(int i = 0;i < n;i++){
        	int count = 1;
        	for(int j = i;j < n - 1;j++){
        		if(arr[j+1] - arr[j] >= 0){

        			count++;
        		}else {

        			break;
        		}
        	}
        	if(count > max){
        		max = count;
        	}
        }
        System.out.println(max);

    }
}


import java.util.Scanner;

public class KefaAndFirstSteps {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int[] arr = new int[n];
		for(int i = 0;i < n;i++){
            arr[i] = sc.nextInt();
        }
        int max = 0;

        for(int i = 0;i < n;i++){
        	int count = 1;
        	for(int j = i;j < n - 1;j++){
        		if(arr[j+1] - arr[j] >= 0){

        			count++;
        		}else {
        			i = j;
        			break;
        		}
        	}
        	if(count > max){
        		max = count;

        	}

        }
        System.out.println(max);
	}

}


import java.util.Scanner;

public class KefaAndFirstSteps {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int[] arr = new int[n];
		for(int i = 0;i < n;i++){
            arr[i] = sc.nextInt();
        }
        int max = 0;

        for(int i = 0;i < n;i++){
        	int count = 1;
        	for(int j = i;j < n - 1;j++){
        		if(arr[j+1] - arr[j] >= 0){

        			count++;
        		}else {
        			i = j;
        			break;
        		}
        	}
        	if(count > max){
        		max = count;

        	}
        	System.out.println("i: "+i);

        }
        System.out.println(max);
	}

}


import java.util.Scanner;

public class Kefa{
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int counter = 0;
        int current = sc.nextInt();
        int next;
        int fnl = 0;

        for (int i = 0; i < n-1; i++) {
        	next = sc.nextInt();
        	if(current <= next) {
        		counter++;
            	if(counter > fnl ) {
            		fnl = counter;
            	}
        	} else {
        		counter=1;
        	}

        }

        System.out.println(fnl);
    }
}


import java.util.Scanner;

public class Kefa{
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int counter = 1;
        int current = sc.nextInt();
        int next;
        int fnl = 0;

        for (int i = 0; i < n-1; i++) {
        	next = sc.nextInt();
        	if(current <= next) {
        		counter++;
        		current = next;
            	if(counter > fnl ) {
            		fnl = counter;
            	}
        	} else {
        		counter = 1;
        	}

        }

        System.out.println(fnl);
    }
}


import java.util.Scanner;

public class Kefa{
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int temp = sc.nextInt();
        int counter = 0;

        for(int i = 0; i < n; i++){
            int nexttemp = sc.next();
            if(temp > nexttemp) {
                break;
            } else {
                temp = nexttemp;
                counter++;
            }
        }
        System.out.println(counter);
    }
}


import java.util.Scanner;

public class Kefa{
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int temp = sc.nextInt();
        int counter = 0;

        for(int i = 0; i < n; i++){
            int nexttemp = sc.nextInt();
            if(temp > nexttemp) {
                break;
            } else {
                temp = nexttemp;
                counter++;
            }
        }
        System.out.println(counter);
    }
}


import java.util.Scanner;

public class Kefa{
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int counter = 0;
        int tempctr = 0;
        boolean once = true;

        int current = sc.nextInt();
        int next;

        for(int i = 0; i < n-1; i++) {
        	next = sc.nextInt();
        	if(current <= next) {
        		if(once)
        			tempctr++;
        		tempctr++;
        		current = next;
        		if(tempctr > counter) {
        			counter = tempctr;
        		}
        	} else {
        		tempctr = 0;
        	}
        }

        if( once && counter == 0)
        	counter = 1;

        System.out.println(counter);
    }
}


import java.util.Scanner;

public class Kefa{
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int counter = 1;
        int tempctr = 1;

        int current = sc.nextInt();
        int next;

        for(int i = 0; i < n-1; i++) {
        	next = sc.nextInt();
        	if(current <= next) {
        		tempctr++;
        		if(tempctr > counter) {
        			counter = tempctr;
        		}
        	} else {
        		tempctr = 1;
        	}
        	current = next;

        }
        System.out.println(counter);
    }
}


import java.util.Scanner;

public class Kefa{
    public static void solution(){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int counter = 1;
        int current = sc.nextInt();
        int next;
        int fnl = 0;

        for (int i = 0; i < n-1; i++) {
        	next = sc.nextInt();
        	if(current <= next) {
        		counter++;
            	if(counter > fnl ) {
            		fnl = counter;
            	}
        	} else {
        		counter = 1;
        	}

        }

        System.out.println(fnl);
    }
}


import java.util.Scanner;

public class Kefa{
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int counter = 1;
        int tempctr = 1;

        int current = sc.nextInt();
        int next;

        for(int i = 0; i < n-1; i++) {
        	next = sc.nextInt();
        	if(current <= next) {
        		tempctr++;
        		current = next;
        		if(tempctr > counter) {
        			counter = tempctr;
        		}
        	} else {
        		tempctr = 1;
        	}
        }
        System.out.println(counter);
    }
}


import java.util.Scanner;

public class Kefa{
    public static void solution(){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int counter = 1;
        int tempctr = 1;

        int current = sc.nextInt();
        int next;

        for(int i = 0; i < n-1; i++) {
        	next = sc.nextInt();
        	if(current <= next) {
        		tempctr++;
        		if(tempctr > counter) {
        			counter = tempctr;
        		}
        	} else {
        		tempctr = 1;
        	}
        	current = next;

        }
        System.out.println(counter);
    }
}


import java.util.Scanner;

public class Kefa{
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int temp = sc.nextInt();

        int counter = 0;
        int tempcounter = 0;

        for(int i = 0; i < n; i++){
            int nexttemp = sc.nextInt();
            if(temp <= nexttemp) {
                tempcounter++;
                temp = nexttemp;
            } else {
                if (tempcounter > counter) {
                    counter = tempcounter;
                    tempcounter = 0;
                {
            }
        }
        System.out.println(counter);
    }
}


import java.util.Scanner;

public class Kefa{
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int temp = sc.nextInt();

        int counter = 0;
        int tempcounter = 0;

        for(int i = 0; i < n; i++){
            int nexttemp = sc.nextInt();
            if(temp <= nexttemp) {
                tempcounter++;
                temp = nexttemp;
            } else {
                if (tempcounter > counter) {
                    counter = tempcounter;
                    tempcounter = 0;
                }
            }
        }

        System.out.println(counter);
    }
}


import java.util.Scanner;

public class AnR {

	public AnR() {
		Scanner scan = new Scanner(System.in);
		int n = scan.nextInt();
		int[] arr = new int[n];
		for(int i=0; i<n; ++i)
			arr[i] = scan.nextInt();

		int maxSeq = 0;

		int j=0;
		while(j < n-1) {
			int temp = 0;
			if(arr[j] <= arr[j+1]) {
				temp += 2;
				++j;
				while(j < n-1 && arr[j] <= arr[j+1]) {
					//System.out.print(arr[j] + " ");
					++temp;
					++j;
				}
				if(temp > maxSeq) {
					maxSeq = temp;
				}

			}else {
				++j;
			}
		}

		System.out.println(maxSeq);

		scan.close();
	}

	public static void main(String[] args) {
		new AnR();
	}

}


import java.util.Scanner;

public class AnR {

	public AnR() {
		Scanner scan = new Scanner(System.in);
		int n = scan.nextInt();
		int[] arr = new int[n];
		for(int i=0; i<n; ++i)
			arr[i] = scan.nextInt();

		int a = 0;
		int maxSeq = 0;
		int temp = 0;
		while(a < n-1) {
			if(arr[a] <= arr[a+1]) {
				temp = 2;
				a += 2;
				while(arr[a] >= arr[a-1] && a < n) {
					++temp;
					++a;
					if(a >= n)
							break;
				}

				if(temp > maxSeq)
					maxSeq = temp;

			}else {
				++a;
			}
		}

		System.out.println(maxSeq);
		scan.close();
	}

	public static void main(String[] args) {
		new AnR();
	}

}


import java.util.Scanner;

public class AnR {

	public AnR() {
		Scanner scan = new Scanner(System.in);
		int n = scan.nextInt();
		int[] arr = new int[n];
		for(int i=0; i<n; ++i)
			arr[i] = scan.nextInt();

		int maxSeq = 0;

		int j=0;
		if(n == 1) {
			maxSeq = 1;
			System.out.println(maxSeq);
		}else {
			while(j < n-1) {
				int temp = 0;
				if(arr[j] <= arr[j+1]) {
					temp += 2;
					++j;
					while(j < n-1 && arr[j] <= arr[j+1]) {
						//System.out.print(arr[j] + " ");
						++temp;
						++j;
					}
					if(temp > maxSeq) {
						maxSeq = temp;
					}

				}else {
					++j;
				}
			}
			System.out.println(maxSeq);
		}

		scan.close();
	}

	public static void main(String[] args) {
		new AnR();
	}

}


import java.util.Scanner;

public class AnR {

	public AnR() {
		Scanner scan = new Scanner(System.in);
		int n = scan.nextInt();
		int[] arr = new int[n];
		for(int i=0; i<n; ++i)
			arr[i] = scan.nextInt();

		int maxSeq = 1;

		int j=0;
		while(j < n-1) {
			int temp = 0;
			if(arr[j] <= arr[j+1]) {
				temp += 2;
				++j;
				while(j < n-1 && arr[j] <= arr[j+1]) {
					//System.out.print(arr[j] + " ");
					++temp;
					++j;
				}
				if(temp > maxSeq) {
					maxSeq = temp;
				}

			}else {
				++j;
			}
		}
		System.out.println(maxSeq);

		scan.close();
	}

	public static void main(String[] args) {
		new AnR();
	}

}


import java.util.Scanner;

public class AnR {

	public AnR() {
		Scanner scan = new Scanner(System.in);
		int n = scan.nextInt();
		long [] arr = new long[n];
		for(int i=0; i<n; ++i)
			arr[i] = scan.nextLong();

		int maxSeq = 0;

		int j=0;
		while(j < n-1) {
			int temp = 0;
			if(arr[j] <= arr[j+1]) {
				temp += 2;
				++j;
				while(j < n-1 && arr[j] <= arr[j+1]) {
					//System.out.print(arr[j] + " ");
					++temp;
					++j;
				}
				if(temp > maxSeq) {
					maxSeq = temp;
				}

			}else {
				++j;
			}
		}

		System.out.println(maxSeq);

		scan.close();
	}

	public static void main(String[] args) {
		new AnR();
	}

}


import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;

public class Kefa {
    public static void main(String[] args) throws IOException {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int []A = new int[n];
        int max = 1 , c = 1;
        for (int i = 0; i < n ; i++) {
            A[i] = in.nextInt();
        }
        fileIn.close();
        for (int i = 0; i < n-1 ; i++) {
            if (A[i] <= A[i+1]) c++;
            else c = 1;
            if (c >= max)
                max = c;
        }
        System.out.println(max);
    }
}


import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;

public class Kefa {
    public static void main(String[] args) throws IOException {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int []A = new int[n];
        int max = 1 , c = 1;
        for (int i = 0; i < n ; i++) {
            A[i] = in.nextInt();
        }
        for (int i = 0; i < n-1 ; i++) {
            if (A[i] < A[i+1]) c++;
            else c = 1;
            if (c >= max)
                max = c;
        }
        System.out.println(max);
    }
}


import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;

public class Kefa {
    public static void main(String[] args) throws IOException {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int []A = new int[n];
        int max = 1 , c = 1;
        for (int i = 0; i < n ; i++) {
            A[i] = in.nextInt();
        }
        for (int i = 0; i < n-1 ; i++) {
            if (A[i] <= A[i+1]) c++;
            else c = 1;
            if (c >= max)
                max = c;
        }
        System.out.println(max);
    }
}


import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;

public class Kefa {
    public static void main(String[] args) throws IOException {
        FileReader fileIn = new FileReader("File/ladder.in");
        FileWriter writer = new FileWriter("File/ladder.out");
        Scanner in = new Scanner(fileIn);
        int n = in.nextInt();
        int []A = new int[n];
        int max = 1 , c = 1;
        for (int i = 0; i < n ; i++) {
            A[i] = in.nextInt();
        }
        fileIn.close();
        for (int i = 0; i < n-1 ; i++) {
            if (A[i] < A[i+1]) c++;
            else c = 1;
            if (c >= max)
                max = c;
        }
        System.out.println(max);
    }
}


import java.util.ArrayList;
import java.util.Scanner;

public class A580 {

    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);

        int n = scan.nextInt();
        int[] values = new int[n];
        for(int i = 0; i < n; i++) {
            values[i] = scan.nextInt();
        }

        // Brute force: Start at every number and loop until non decreasing O(n^2)
        /*
        int maxSeg = 0;
        for(int i = 0; i < n; i++) {
            int seg = 1;
            for(int k = i; k < n - 1; k++) {
                if(values[k] <= values[k + 1]) {
                    seg++;
                } else {
                    break;
                }
            }
            if(seg > maxSeg) {
                maxSeg = seg;
            }
        }

        System.out.println(maxSeg);
         */

        // Better solution: Find indices of decrease and find max length of segments O(n)

        ArrayList<Integer> decr = new ArrayList<Integer>();

        for(int i = 0; i < n - 1; i++) {
            if(values[i] > values[i + 1]) {
                decr.add(i);
            }
        }

        int maxSeg = -1;
        if(decr.size() == 0) {
            maxSeg = values.length;
        } else if (decr.size() == 1) {
            maxSeg = Math.max(decr.get(0) + 1, values.length - 1 - decr.get(0));
        } else {
            for(int k = 0; k < decr.size(); k++) {
                int seg;
                if(k == 0) {
                    seg = decr.get(k) + 1;
                } else if(k == decr.size() - 1) {
                    seg = values.length - 1 - decr.get(k);
                } else {
                    seg = decr.get(k + 1) - decr.get(k);
                }

                if(seg > maxSeg) {
                    maxSeg = seg;
                }
            }
        }

        System.out.println(maxSeg);

    }

}


import java.util.Scanner;

public class A580 {

    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);

        int n = scan.nextInt();
        int[] values = new int[n];
        for(int i = 0; i < n; i++) {
            values[i] = scan.nextInt();
        }

        // Brute force: Start at every number and loop until non decreasing
        int maxSeg = 0;
        for(int i = 0; i < n; i++) {
            int seg = 1;
            for(int k = i; k < n - 1; k++) {
                if(values[k] <= values[k + 1]) {
                    seg++;
                } else {
                    break;
                }
            }
            if(seg > maxSeg) {
                maxSeg = seg;
            }
        }

        System.out.println(maxSeg);

    }

}


import java.util.ArrayList;
import java.util.Scanner;

public class A580 {

    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);

        int n = scan.nextInt();
        int[] values = new int[n];
        for(int i = 0; i < n; i++) {
            values[i] = scan.nextInt();
        }

        // Brute force: Start at every number and loop until non decreasing O(n^2)
        /*
        int maxSeg = 0;
        for(int i = 0; i < n; i++) {
            int seg = 1;
            for(int k = i; k < n - 1; k++) {
                if(values[k] <= values[k + 1]) {
                    seg++;
                } else {
                    break;
                }
            }
            if(seg > maxSeg) {
                maxSeg = seg;
            }
        }

        System.out.println(maxSeg);
         */

        // Better solution: Find indices of decrease and find max length of segments O(n)

        ArrayList<Integer> decr = new ArrayList<Integer>();

        for(int i = 0; i < n - 1; i++) {
            if(values[i] > values[i + 1]) {
                decr.add(i);
            }
        }

        int maxSeg = -1;
        if(decr.size() == 0) {
            maxSeg = values.length;
        } else {
            maxSeg = decr.get(0) + 1;
            for(int k = 0; k < decr.size(); k++) {
                int seg;
                if(k == decr.size() - 1) {
                    seg = values.length - 1 - decr.get(k);
                } else {
                    seg = decr.get(k + 1) - decr.get(k);
                }

                if(seg > maxSeg) {
                    maxSeg = seg;
                }
            }
        }

        System.out.println(maxSeg);

    }

}


import java.util.Scanner;

public class A580 {

    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);

        int n = scan.nextInt();
        int[] values = new int[n];
        for(int i = 0; i < n; i++) {
            values[i] = scan.nextInt();
        }

        // Brute force: Start at every number and loop until non decreasing O(n^2)
        /*
        int maxSeg = 0;
        for(int i = 0; i < n; i++) {
            int seg = 1;
            for(int k = i; k < n - 1; k++) {
                if(values[k] <= values[k + 1]) {
                    seg++;
                } else {
                    break;
                }
            }
            if(seg > maxSeg) {
                maxSeg = seg;
            }
        }

        System.out.println(maxSeg);
         */

        // Better solution: Find indices of decrease and find max length of segments O(n)
        int lastDec = 0;
        int maxSeg = -1;

        for(int i = 0; i < n - 1; i++) {
            if(values[i] > values[i + 1]) {
                int seg = i - lastDec;
                if(seg > maxSeg) {
                    maxSeg = seg;
                }
                lastDec = i;
            }
        }
        // Loop did not find any decreases
        if(maxSeg == -1) {
            maxSeg = n;
        }

        System.out.println(maxSeg);

    }

}


import java.util.Scanner;

public class A580 {

    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);

        int n = scan.nextInt();
        int[] values = new int[n];
        for(int i = 0; i < n; i++) {
            values[i] = scan.nextInt();
        }

        // Brute force: Start at every number and loop until non decreasing O(n^2)
        /*
        int maxSeg = 0;
        for(int i = 0; i < n; i++) {
            int seg = 1;
            for(int k = i; k < n - 1; k++) {
                if(values[k] <= values[k + 1]) {
                    seg++;
                } else {
                    break;
                }
            }
            if(seg > maxSeg) {
                maxSeg = seg;
            }
        }

        System.out.println(maxSeg);
         */

        // Better solution: Find indices of decrease and find max length of segments O(n)
        int lastDec = 0;
        int maxSeg = -1;

        for(int i = 0; i < n - 1; i++) {
            if(values[i] > values[i + 1]) {
                int seg = lastDec == 0 ? i - lastDec + 1 : i - lastDec;
                if(seg > maxSeg) {
                    maxSeg = seg;
                }
                lastDec = i;
            }
        }
        // Loop did not find any decreases
        if(maxSeg == -1) {
            maxSeg = n;
        }

        System.out.println(maxSeg);

    }

}


import java.util.Scanner;

public class A580 {

    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);

        int n = scan.nextInt();
        int[] values = new int[n];
        for(int i = 0; i < n; i++) {
            values[i] = scan.nextInt();
        }

        // Brute force: Start at every number and loop until non decreasing O(n^2)
        /*
        int maxSeg = 0;
        for(int i = 0; i < n; i++) {
            int seg = 1;
            for(int k = i; k < n - 1; k++) {
                if(values[k] <= values[k + 1]) {
                    seg++;
                } else {
                    break;
                }
            }
            if(seg > maxSeg) {
                maxSeg = seg;
            }
        }

        System.out.println(maxSeg);
         */

        // Better solution: Find indices of decrease and find max length of segments O(n)
        int lastDec = 0;
        int maxSeg = -1;

        for(int i = 0; i < n; i++) {
            if(i == n - 1 || values[i] > values[i + 1]) {
                int seg = lastDec == 0 ? i - lastDec + 1 : i - lastDec;
                if(seg > maxSeg) {
                    maxSeg = seg;
                }
                lastDec = i;
            }
        }
        // Loop did not find any decreases
        if(maxSeg == -1) {
            maxSeg = n;
        }

        System.out.println(maxSeg);

    }

}


import java.util.ArrayList;
import java.util.Scanner;

public class A580 {

    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);

        int n = scan.nextInt();
        int[] values = new int[n];
        for(int i = 0; i < n; i++) {
            values[i] = scan.nextInt();
        }

        // Brute force: Start at every number and loop until non decreasing O(n^2)
        /*
        int maxSeg = 0;
        for(int i = 0; i < n; i++) {
            int seg = 1;
            for(int k = i; k < n - 1; k++) {
                if(values[k] <= values[k + 1]) {
                    seg++;
                } else {
                    break;
                }
            }
            if(seg > maxSeg) {
                maxSeg = seg;
            }
        }

        System.out.println(maxSeg);
         */

        // Better solution: Find indices of decrease and find max length of segments O(n)

        ArrayList<Integer> decr = new ArrayList<Integer>();

        for(int i = 0; i < n - 1; i++) {
            if(values[i] > values[i + 1]) {
                decr.add(i);
            }
        }

        int maxSeg = -1;
        if(decr.size() == 0) {
            maxSeg = values.length;
        } else if (decr.size() == 1) {
            maxSeg = Math.max(decr.get(0) + 1, values.length - 1 - decr.get(0));
        } else {
            maxSeg = decr.get(0) + 1;
            for(int k = 0; k < decr.size(); k++) {
                int seg;
                if(k == decr.size() - 1) {
                    seg = values.length - 1 - decr.get(k);
                } else {
                    seg = decr.get(k + 1) - decr.get(k);
                }

                if(seg > maxSeg) {
                    maxSeg = seg;
                }
            }
        }

        System.out.println(maxSeg);

    }

}


import java.util.ArrayList;
import java.util.Scanner;

public class A580 {

    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);

        int n = scan.nextInt();
        int[] values = new int[n];
        for(int i = 0; i < n; i++) {
            values[i] = scan.nextInt();
        }

        // Brute force: Start at every number and loop until non decreasing O(n^2)
        /*
        int maxSeg = 0;
        for(int i = 0; i < n; i++) {
            int seg = 1;
            for(int k = i; k < n - 1; k++) {
                if(values[k] <= values[k + 1]) {
                    seg++;
                } else {
                    break;
                }
            }
            if(seg > maxSeg) {
                maxSeg = seg;
            }
        }

        System.out.println(maxSeg);
         */

        // My solution: Find indices of decrease and find max length of segments O(n)
        /*
        ArrayList<Integer> decr = new ArrayList<Integer>();

        for(int i = 0; i < n - 1; i++) {
            if(values[i] > values[i + 1]) {
                decr.add(i);
            }
        }

        int maxSeg = -1;
        if(decr.size() == 0) {
            maxSeg = values.length;
        } else {
            maxSeg = decr.get(0) + 1;
            for(int k = 0; k < decr.size(); k++) {
                int seg;
                if(k == decr.size() - 1) {
                    seg = values.length - 1 - decr.get(k);
                } else {
                    seg = decr.get(k + 1) - decr.get(k);
                }

                if(seg > maxSeg) {
                    maxSeg = seg;
                }
            }
        }

        System.out.println(maxSeg);
         */

        // Editorial Solution
        ArrayList<Integer> seqs = new ArrayList<Integer>();
        int curr = 1;
        for(int i = 0; i < n - 1; i++) {
            if(values[i + 1] >= values[i]) {
                curr++;
            } else {
                seqs.add(curr);
                curr = 1;
            }
        }
        seqs.add(curr);

        int maxSeg = seqs.get(0);
        for(int k = 1; k < seqs.size(); k++) {
            if(seqs.get(k) > maxSeg) {
                maxSeg = seqs.get(k);
            }
        }

        System.out.println(maxSeg);
    }

}


import java.util.Scanner;
public class kefa
{
    public static void main(String args[])
    {
        Scanner sc=new Scanner(System.in);

        int n=sc.nextInt();
        int ar[]=new int[n];
        for(int x=0;x<n;x++)
        {
            ar[x]=sc.nextInt();
        }
        int max=0;
        int c=1;
        for(int x=0;x<n-1;x++)
        {
            if(ar[x]<ar[x+1])
                c++;
            else
                c=1;
            if(c>max)
            max=c;
        }
        System.out.println(max);
    }
}


import java.util.Scanner;
public class kefa
{
    public static void main(String args[])
    {
        Scanner sc=new Scanner(System.in);

        int n=sc.nextInt();
        int ar[]=new int[n];
        for(int x=0;x<n;x++)
        {
            ar[x]=sc.nextInt();
        }
        int max=0;
        int c=1;
        for(int x=0;x<n-1;x++)
        {
            if(ar[x]<=ar[x+1])
                c++;
            else
                c=1;
            if(c>max)
            max=c;
        }
        if(n==1)
        max=1;
        System.out.println(max);
    }
}


import java.util.Scanner;
public class kefa
{
    public static void main(String args[])
    {
        Scanner sc=new Scanner(System.in);

        int n=sc.nextInt();
        int ar[]=new int[n];
        for(int x=0;x<n;x++)
        {
            ar[x]=sc.nextInt();
        }
        int max=0;
        int c=1;
        for(int x=0;x<n-1;x++)
        {
            if(ar[x]<=ar[x+1])
                c++;
            else
                c=1;
            if(c>max)
            max=c;
        }
        System.out.println(max);
    }
}


import java.io.*;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.*;
public class mainFile{
    public static void main(String[] args) {
        int answer= 0;
        try(BufferedReader reader = new BufferedReader(new InputStreamReader(System.in)))
        {
            StringTokenizer num = new StringTokenizer(reader.readLine());
            int n = Integer.parseInt(num.nextToken());

            StringTokenizer nums = new StringTokenizer(reader.readLine());
            int [] theNums = new int [n];
            for(int i = 0; i< n ; i++){
                theNums[i]= Integer.parseInt(nums.nextToken());
            }
            int count = 1;
            int max = 1;
            for(int i = 0;i< n-1; i++){
                if(theNums[i]<=theNums[i+1]){
                    count++;
                }
                else{
                    count = 1;
                }
                max = Math.max(count, max);
                //jyomama
            }

            answer = max;

        }
        catch(IOException e)
        {
            e.printStackTrace();
        }

        PrintWriter writer = new PrintWriter(System.out);
        writer.println(answer);
        writer.close();
    }
}


import java.io.*;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.*;
public class mainFile{
    public static void main(String[] args) {
        int answer = 0;
        try(BufferedReader reader = new BufferedReader(new InputStreamReader(System.in)))
        {
            StringTokenizer num = new StringTokenizer(reader.readLine());
            int n = Integer.parseInt(num.nextToken());

            StringTokenizer nums = new StringTokenizer(reader.readLine());
            int [] theNums = new int [n];
            for(int i = 0; i< n ; i++){
                theNums[i]= Integer.parseInt(nums.nextToken());
            }
            int count = 1;
            int max = 0;
            for(int i = 0;i< n-1; i++){
                if(theNums[i]<=theNums[i+1]){
                    count++;
                }
                else{
                    count = 1;
                }
                max = Math.max(count, max);

            }

            answer = max;

        }
        catch(IOException e)
        {
            e.printStackTrace();
        }

        PrintWriter writer = new PrintWriter(System.out);
        writer.println(answer);
        writer.close();
    }
}


import java.io.*;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.*;
public class mainFile{
    public static void main(String[] args) {
        int answer;
        try(BufferedReader reader = new BufferedReader(new InputStreamReader(System.in)))
        {
            StringTokenizer num = new StringTokenizer(reader.readLine());
            int n = Integer.parseInt(num.nextToken());

            StringTokenizer nums = new StringTokenizer(reader.readLine());
            int [] theNums = new int [n];
            for(int i = 0; i< n ; i++){
                theNums[i]= Integer.parseInt(nums.nextToken());
            }
            int count = 1;
            int max = 0;
            for(int i = 0;i< n-1; i++){
                if(theNums[i]<=theNums[i+1]){
                    count++;
                }
                else{
                    count = 1;
                }
                max = Math.max(count, max);
                //jyomama
            }

            answer = max;

        }
        catch(IOException e)
        {
            e.printStackTrace();
        }

        PrintWriter writer = new PrintWriter(System.out);
        writer.println(answer);
        writer.close();
    }
}


import java.io.*;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.*;
public class mainFile{
    public static void main(String[] args) {
        int answer = 0;
        try(BufferedReader reader = new BufferedReader(new InputStreamReader(System.in)))
        {
            StringTokenizer num = new StringTokenizer(reader.readLine());
            int n = Integer.parseInt(num.nextToken());

            StringTokenizer nums = new StringTokenizer(reader.readLine());
            int [] theNums = new int [n];
            for(int i = 0; i< n ; i++){
                theNums[i]= Integer.parseInt(nums.nextToken());
            }
            int count = 1;
            int max = 0;
            for(int i = 0;i< n-1; i++){
                if(theNums[i]<=theNums[i+1]){
                    count++;
                }
                else{
                    count = 1;
                }
                max = Math.max(count, max);
                //jyomama
            }

            answer = max;

        }
        catch(IOException e)
        {
            e.printStackTrace();
        }

        PrintWriter writer = new PrintWriter(System.out);
        writer.println(answer);
        writer.close();
    }
}


//package random_practiceQuestions;

import java.util.Scanner;

public class A580 {
    public static void main(String[] args){
        Scanner s = new Scanner(System.in);
        int a = s.nextInt();
        String ytguybh = s.nextLine();
        String[] l = s.nextLine().split(" ");
        int[] list = new int[l.length];
        for (int i=0;i<l.length;i++){
            list[i]=Integer.parseInt(l[i]);
        }
        int max = 0;
        int count=0;
        for (int i=1;i<list.length;i++){
            if (count>max){
                max=count;
            }
            if (list[i]>=list[i-1]){
                count++;
            }
            else{
                count=0;
            }
        }
        System.out.println(max+1);
    }
}


//package random_practiceQuestions;

import java.util.Scanner;

public class A580 {
    public static void main(String[] args){
        Scanner s = new Scanner(System.in);
        int a = s.nextInt();
        String ytguybh = s.nextLine();
        String[] l = s.nextLine().split(" ");
        int[] list = new int[l.length];
        for (int i=0;i<l.length;i++){
            list[i]=Integer.parseInt(l[i]);
        }
        int max = 0;
        int count=0;
        for (int i=1;i<list.length;i++){
            if (count>max){
                max=count;
            }
            if (list[i]>=list[i-1]){
                count++;
                if (count==1){
                    count++;
                }
            }
            else{
                count=0;
            }
        }
        if (count>max){
            max=count;
        }
        if (list.length==1){
            max=1;
        }
        System.out.println(max);
    }
}


//package random_practiceQuestions;

import java.util.Scanner;

public class A580 {
    public static void main(String[] args){
        Scanner s = new Scanner(System.in);
        int a = s.nextInt();
        String ytguybh = s.nextLine();
        String[] l = s.nextLine().split(" ");
        int[] list = new int[l.length];
        for (int i=0;i<l.length;i++){
            list[i]=Integer.parseInt(l[i]);
        }
        int max = 0;
        int count=0;
        for (int i=1;i<list.length;i++){
            if (count>max){
                max=count;
            }
            if (list[i]>=list[i-1]){
                count++;
                if (count==1){
                    count++;
                }
            }
            else{
                count=0;
            }
        }
        System.out.println(max);
    }
}


//package random_practiceQuestions;

import java.util.Scanner;

public class A580 {
    public static void main(String[] args){
        Scanner s = new Scanner(System.in);
        int a = s.nextInt();
        String ytguybh = s.nextLine();
        String[] l = s.nextLine().split(" ");
        int[] list = new int[l.length];
        for (int i=0;i<l.length;i++){
            list[i]=Integer.parseInt(l[i]);
        }
        int max = 0;
        int count=0;
        for (int i=1;i<list.length;i++){
            if (count>max){
                max=count;
            }
            if (list[i]>=list[i-1]){
                count++;
                if (count==1){
                    count++;
                }
            }
            else{
                count=0;
            }
        }
        if (count>max){
            max=count;
        }
        System.out.println(max);
    }
}


//package random_practiceQuestions;

import java.util.Scanner;

public class A580 {
    public static void main(String[] args){
        Scanner s = new Scanner(System.in);
        int a = s.nextInt();
        String ytguybh = s.nextLine();
        String[] l = s.nextLine().split(" ");
        int[] list = new int[l.length];
        for (int i=0;i<l.length;i++){
            list[i]=Integer.parseInt(l[i]);
        }
        int max = 0;
        int count=0;
        for (int i=1;i<list.length;i++){
            if (count>max){
                max=count;
            }
            if (list[i]>=list[i-1]){
                count++;
                if (count==1){
                    count++;
                }
            }
            else{
                count=0;
            }
        }
        if (count>max){
            max=count;
        }
        if (max==0){
            max=1;
        }
        System.out.println(max);
    }
}


import java.util.Scanner;

public class Kefa_and_First_Steps {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] arr = new int[n];
        for(int i=0;i<n;i++)
            arr[i]=sc.nextInt();
        sc.close();
        int max = 0;
        int temp = 1;
        for (int i=0;i<n-1;i++){
            if(arr[i]<=arr[i+1])
                temp++;
            else temp = 1;

            if(temp>max)
                max = temp;
        }
        System.out.println(max);
    }
}


import java.util.Scanner;

public class Kefa_and_First_Steps {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        long[] arr = new long[n];
        for(int i=0;i<n;i++)
            arr[i]=sc.nextInt();
        sc.close();
        int max = 0;
        int temp = 1;
        for (int i=0;i<n-1;i++){
            if(arr[i]<=arr[i+1])
                temp++;
            else temp = 1;

            if(temp>max)
                max = temp;
        }
        System.out.println(max);
    }
}


import java.util.Scanner;

public class Kefa_and_First_Steps {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        long[] arr = new long[n];
        int max = 1;
        int temp = 1;
        for (int i=0;i<n;i++){
            arr[i] = sc.nextInt();
            if(i>0) {
                if (arr[i] >= arr[i - 1]) {
                    temp++;
                    if (temp > max)
                        max = temp;
                }
                else temp = 1;
            }
        }
        System.out.println(max);
    }
}


import java.util.*;
public class Main {
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = scan.nextInt();
        }
        ArrayList<Integer> x = new ArrayList<>();
        int y = 0;
        int z = 0;
        for (int i = 0; i < n - 1; i++) {
            if (a[i+1] >= a[i]) {
                y++;
                if(y==n-1){
                    x.add(y+1-z);
                }
            } else {
                x.add(y +1- z);
                z = i+1;
                y=z+1;
                //System.out.println(z);
                //System.out.println(y);
                //System.out.println(i);
            }
        }
        int max=0;
        for(int i=0;i<x.size();i++){
            if(x.get(i)>max){
                max=x.get(i);
            }
        }
        if (x.size() == 0) System.out.println(n);
        else {
            System.out.println(max);
        }
    }
}


import java.util.*;
public class Main {
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = scan.nextInt();
        }
        ArrayList<Integer> x = new ArrayList<>();
        int y = 1;
        int z = 0;
        for (int i = 0; i < n - 1; i++) {
            if (a[i+1] >= a[i]) {
                y++;
                if(y==a[n-1]){
                    x.add(y);
                }
            } else {
                x.add(y - z);
                z = y;
                y++;
            }
        }
        int max=0;
        for(int i=0;i<x.size();i++){
            if(x.get(i)>max) max=x.get(i);
        }
        if (x.size() == 0) System.out.println(n);
        else {
            System.out.println(max);
        }
    }
}


import java.util.*;
public class Main {
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = scan.nextInt();
        }
        ArrayList<Integer> x = new ArrayList<>();
        int y = 1;
        int z = 0;
        for (int i = 0; i < n - 1; i++) {
            if (a[i+1] >= a[i]) {
                y++;
                if(y==a[n-1]){
                    x.add(y);
                }
            } else {
                x.add(y - z);
                z = y;
                y++;
            }
        }
        int max=0;
        for(int i=0;i<x.size();i++){
            if(x.get(i)>=max) max=x.get(i);
        }
        if (x.size() == 0) System.out.println(n);
        else {
            System.out.println(max);
        }
    }
}


import java.util.*;
public class Main {
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = scan.nextInt();
        }
        ArrayList<Integer> x = new ArrayList<>();
        int y = 1;
        int z = 0;
        for (int i = 0; i < n - 1; i++) {
            if (a[i+1] >= a[i]) {
                y++;
            } else {
                x.add(y - z);
                z = y;
                y++;
            }
        }
        int max=0;
        for(int i=0;i<x.size();i++){
            if(x.get(i)>max) max=x.get(i);
        }
        if (x.size() == 0) System.out.println(n);
        else {
            System.out.println(max);
        }
    }
}


import java.util.*;
public class Main {
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = scan.nextInt();
        }
        ArrayList<Integer> x = new ArrayList<>();
        int y = 1;
        int z = 0;
        for (int i = 0; i < n - 1; i++) {
            if (a[i+1] >= a[i]) {
                y++;
                if(y==a[n-1]){
                    x.add(n-z);
                }
            } else {
                x.add(y - z);
                z = y;
                y++;
            }
        }
        int max=0;
        for(int i=0;i<x.size();i++){
            if(x.get(i)>max) max=x.get(i);
        }
        if (x.size() == 0) System.out.println(n);
        else {
            System.out.println(max);
        }
    }
}


import java.util.*;
public class Main {
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = scan.nextInt();
        }
        ArrayList<Integer> x = new ArrayList<>();
        int y = 0;
        int z = 0;
        for (int i = 0; i < n - 1; i++) {
            if (a[i + 1] >= a[i]) {
                y++;
                //System.out.println(y+"a");
                if (y == n - 1) {
                    x.add(y + 1 - z);
                    break;
                }
            } else {
                x.add(y + 1 - z);
                z = y + 1;
                y = y + 1;
                //System.out.println(z);
                //System.out.println(y);
                //System.out.println(i);
            }
        }
        int max=0;
        for(int i=0;i<x.size();i++){
            if(x.get(i)>max){
                max=x.get(i);
            }
        }
        if (x.size() == 0) System.out.println(n);
        else {
            System.out.println(max);
        }
    }
}


import java.util.*;
public class Main {
    public static void main(String[] args) {
        Scanner console = new Scanner(System.in);
        int n = console.nextInt();
        int row = 1;
        int[] array = new int[n];
        for (int i = 0; i < n; i++) {
          array[i] = console.nextInt();
        }
        if (array.length == 1) {
          System.out.println(1);
          return;
        }
        ArrayList<Integer> list = new ArrayList<Integer>();
        for (int i = 0; i < n - 1; i++) {
          if (array[i] <= array[i+1]) {
            row++;
            if (i == n - 2) {
              list.add(row);
            }
          } else {
            list.add(row);
            row = 1;
          }
        }
        Collections.sort(list);
        System.out.println(list.get(list.size() -1));
    }
  }


import java.util.*;
public class Main {
    public static void main(String[] args) {
        Scanner console = new Scanner(System.in);
        int n = console.nextInt();
        int row = 1;
        int[] array = new int[n];
        for (int i = 0; i < n; i++) {
          array[i] = console.nextInt();
        }
        ArrayList<Integer> list = new ArrayList<Integer>();
        for (int i = 0; i < n - 1; i++) {
          if (array[i] <= array[i+1]) {
            row++;
            if (i == n - 1) {
              list.add(row);
            }
          } else {
            list.add(row);
            row = 1;
          }
        }
        Collections.sort(list);
        System.out.println(list.get(list.size() -1));
    }
  }


import java.util.*;
public class Main {
    public static void main(String[] args) {
        Scanner console = new Scanner(System.in);
        int n = console.nextInt();
        int row = 1;
        int[] array = new int[n];
        for (int i = 0; i < n; i++) {
          array[i] = console.nextInt();
        }
        ArrayList<Integer> list = new ArrayList<Integer>();
        for (int i = 0; i < n - 1; i++) {
          if (array[i] <= array[i+1]) {
            row++;
          } else {
            list.add(row);
            row = 1;
          }
        }
        Collections.sort(list);
        System.out.println(list.get(list.size() -1));
    }
  }


import java.util.*;
public class Main {
    public static void main(String[] args) {
        Scanner console = new Scanner(System.in);
        int n = console.nextInt();
        int row = 1;
        int[] array = new int[n];
        for (int i = 0; i < n; i++) {
          array[i] = console.nextInt();
        }
        ArrayList<Integer> list = new ArrayList<Integer>();
        for (int i = 0; i < n - 1; i++) {
          if (array[i] <= array[i+1]) {
            row++;
            if (i == n - 1) {
              list.add(row);
            }
          } else {
            list.add(row);
            row = 1;
          }
        }
        Collections.sort(list);
        System.out.println(list.get(list.size() -1));
  }


import java.util.*;
public class Main {
    public static void main(String[] args) {
        Scanner console = new Scanner(System.in);
        int n = console.nextInt();
        int row = 1;
        int[] array = new int[n];
        for (int i = 0; i < n; i++) {
          array[i] = console.nextInt();
        }
        ArrayList<Integer> list = new ArrayList<Integer>();
        for (int i = 0; i < n - 1; i++) {
          if (array[i] <= array[i+1]) {
            row++;
            if (i == n - 2) {
              list.add(row);
            }
          } else {
            list.add(row);
            row = 1;
          }
        }
        Collections.sort(list);
        System.out.println(list.get(list.size() -1));
    }
  }


import java.util.*;
public class Main {
    public static void main(String[] args) {
        Scanner console = new Scanner(System.in);
        int n = console.nextInt();
        int row = 1;
        int[] array = new int[n];
        for (int i = 0; i < n; i++) {
          array[i] = console.nextInt();
        }
        ArrayList<Integer> list = new ArrayList<Integer>();
        for (int i = 0; i < n - 1; i++) {
          if (array[i] <= array[i+1]) {
            row++;
          } else {
            list.add(row);
            row = 1;
          }
        }
        Collections.sort(list);
        if (row == n) {
          System.out.println(row);
        } else {
        System.out.println(list.get(list.size() -1));
        }
    }
  }


import java.util.*;

public class S {

	public static void main(String[] args) {

		Scanner in = new Scanner(System.in);

		int n = in.nextInt();
		int[] arr = new int[n];

		for(int i = 0; i<n; i++)
			arr[i] = in.nextInt();

		int ans = 1, max = Integer.MIN_VALUE;
		if(n==1) System.out.println(1);
		else {
			for(int i = 0; i<n-1; i++) {
				if(arr[i]<=arr[i+1]) {
					ans++;
					if(max<ans) max = ans;
				}else ans = 1;

			}
			System.out.println(max);
		}

	}
}


import java.util.*;

public class S {

	public static void main(String[] args) {

		Scanner in = new Scanner(System.in);

		int n = in.nextInt();
		int[] arr = new int[n];

		for(int i = 0; i<n; i++)
			arr[i] = in.nextInt();

		int ans = 1, max = 1;
		if(n==1) System.out.println(1);
		else {
			for(int i = 0; i<n-1; i++) {
				if(arr[i]<=arr[i+1]) {
					ans++;
					if(max<ans) max = ans;
				}else ans = 1;

			}
			System.out.println(max);
		}

	}
}


import java.util.*;

public class S {

	public static void main(String[] args) {

		Scanner in = new Scanner(System.in);

		int n = in.nextInt();
		int[] arr = new int[n];

		for(int i = 0; i<n; i++)
			arr[i] = in.nextInt();

		int ans = 1, max = Integer.MIN_VALUE;

		for(int i = 0; i<n-1; i++) {
			if(arr[i]<=arr[i+1]) {
				ans++;
				if(max<ans) max = ans;
			}else ans = 1;

		}

		System.out.println(max);
	}
}


import java.util.*;
public class Main
{
	public static void main(String[] args) {

	    Scanner sc = new Scanner(System.in);
	    int n = sc.nextInt();
	    int a[] = new int[n];
	    int count=0,len=0;
	    for(int i=0;i<n;i++)
	    {
	        a[i]=sc.nextInt();

	    }
	    for(int i=0;i<n;i++)
	    {
	        if(i<n-1){
    	        if(a[i]<=a[i+1])
    	        {
    	            count++;
    	           // System.out.println(a[i]+" "+a[i+1]+" = "+count);
    	        }
    	        else count=0;

    	        if(len<count)
    	        {   len=count;
    	        }
	        }
	    }
	    System.out.print(len+1);

	}
}


import java.util.*;
public class Main
{
	public static void main(String[] args) {

	    Scanner sc = new Scanner(System.in);
	    int n = sc.nextInt();
	    int a[] = new int[n];
	    int count=0,len=0;
	    for(int i=0;i<n;i++)
	    {
	        a[i]=sc.nextInt();

	    }
	    for(int i=0;i<n;i++)
	    {
	        if(i<n-1){
	        if(a[i]<=a[i+1])
	        {
	            count++;
	           // System.out.println(a[i]+" "+a[i+1]+" = "+count);
	        }
	        else
	        {
	            if(len<count)
	            len=count;
	            count=0;
	        }
	        }
	    }
	    System.out.print(len+1);

	}
}


import java.util.*;
public class Main
{
	public static void main(String[] args) {

	    Scanner sc = new Scanner(System.in);
	    int n = sc.nextInt();
	    int a[] = new int[n];
	    int count=0,c=0;
	    for(int i=0;i<n;i++)
	    {
	        a[i]=sc.nextInt();

	    }
	    for(int i=0;i<n;i++)
	    {
	        if(i<n-1){
	        if(a[i]<=a[i+1])
	        {
	            count++;
	        }
	        else c++;}
	    }
	    if(c==0)
	    System.out.print(a.length);
	    else
	    System.out.print(c+1);

	}
}


import java.util.*;
public class Main
{
	public static void main(String[] args) {

	    Scanner sc = new Scanner(System.in);
	    int n = sc.nextInt();
	    int a[] = new int[n];
	    int count=0,len=0;
	    for(int i=0;i<n;i++)
	    {
	        a[i]=sc.nextInt();

	    }
	    for(int i=0;i<n;i++)
	    {
	        if(i<n-1){
    	        if(a[i]<=a[i+1])
    	        {
    	            count++;
    	            System.out.println(a[i]+" "+a[i+1]+" = "+count);
    	        }
    	        else count=0;

    	        if(len<count)
    	        {   len=count;
    	        }
	        }
	    }
	    System.out.print(len+1);

	}
}


import java.util.*;
public class Main
{
	public static void main(String[] args) {

	    Scanner sc = new Scanner(System.in);
	    int n = sc.nextInt();
	    int a[] = new int[n];
	    int count=0,c=0;
	    for(int i=0;i<n;i++)
	    {
	        a[i]=sc.nextInt();

	    }
	    for(int i=1;i<n;i++)
	    {

	        if(a[i-1]<=a[i])
	        {
	            count++;
	        }
	        else c++;
	    }
	    if(c==0)
	    System.out.print(a.length);
	    else
	    System.out.print(c+1);

	}
}


import java.util.Scanner;

public class kefa {
    public static void main(String args[]) {
        Scanner input = new Scanner(System.in);
        int n = input.nextInt();
        int arr[] = new int[n];
            for (int i = 0; i < n; i++) {
                arr[i] = input.nextInt();
            }
            if (n == 1) {
                System.out.println("1");
            }
            else {
            int a = 1;
            int k = 1;
            for (int i = 0; i < n; i++) {
                if (i < n - 1) {
                    if (arr[i + 1] >= arr[i]) {
                        a += 1;
                        if (k < a) {
                            k = a;
                        }
                    }
                    else
                        a = 1;
                }
            }
            System.out.println(k);
        }
    }
}


import java.util.Scanner;

public class kefa {
    public static void main(String args[]) {
        Scanner input = new Scanner(System.in);
        int n = input.nextInt();
        int arr[] = new int[n];
        if (n == 1) {
            System.out.println("0");
        } else {
            for (int i = 0; i < n; i++) {
                arr[i] = input.nextInt();
            }
            int a = 1;
            int k = 0;
            for (int i = 0; i < n; i++) {
                if (i < n - 1) {
                    if (arr[i + 1] >= arr[i]) {
                        a += 1;
                        if (k < a) {
                            k = a;
                        }
                    } else
                        a = 1;
                }
            }
            System.out.println(k);
        }
    }
}


import java.util.Scanner;

public class kefa {
    public static void main(String args[]) {
        Scanner input = new Scanner(System.in);
        int n = input.nextInt();
        int arr[] = new int[n];
            for (int i = 0; i < n; i++) {
                arr[i] = input.nextInt();
            }
            if (n == 1) {
                System.out.println("1");
            }
            else {
            int a = 1;
            int k = 0;
            for (int i = 0; i < n; i++) {
                if (i < n - 1) {
                    if (arr[i + 1] >= arr[i]) {
                        a += 1;
                        if (k < a) {
                            k = a;
                        }
                    } else
                        a = 1;
                }
            }
            System.out.println(k);
        }
    }
}


import java.util.Scanner;

public class kefa {
    public static void main(String args[]) {
        Scanner input = new Scanner(System.in);
        int n = input.nextInt();
        int arr[] = new int[n];
            for (int i = 0; i < n; i++) {
                arr[i] = input.nextInt();
            }
            if (n == 1) {
                System.out.println("0");
            }
            else {
            int a = 1;
            int k = 0;
            for (int i = 0; i < n; i++) {
                if (i < n - 1) {
                    if (arr[i + 1] >= arr[i]) {
                        a += 1;
                        if (k < a) {
                            k = a;
                        }
                    } else
                        a = 1;
                }
            }
            System.out.println(k);
        }
    }
}


import java.util.Scanner;

public class kefa {
    public static void main(String args[]){
        Scanner input=new Scanner(System.in);
        int n=input.nextInt();
        int arr[]=new int[n];
        for(int i=0;i<n;i++){
            arr[i]=input.nextInt();
        }
        int a=1;
        int k=0;
        for(int i=0;i<n;i++){
            if(i<n-1){
                if(arr[i+1]>=arr[i]){
                    a+=1;
                    if(k<a){
                        k=a;
                    }
                }
                else
                    a=1;
            }
        }
        System.out.println(k);
    }
}


import java.util.*;
import java.lang.*;
import java.io.*;
import java.util.Scanner;

public class Frog
{
	public static void main (String[] args) throws java.lang.Exception
	{
		Scanner s=new Scanner(System.in);
		int n=s.nextInt();
		int a[]=new int[n];
		for(int i=0;i<n;i++)
		      a[i]=s.nextInt();
		int count=1,max_count=0;
	      for(int i=0;i<n-1;i++)
	      {
	            if(a[i]<=a[i+1])
	                  count++;
	            else
	                  count=1;
	            if(max_count<count)
	                  max_count=count;
	      }
	      System.out.print(max_count);
	}
}


import java.util.*;
import java.lang.*;
import java.io.*;
import java.util.Scanner;

public class Frog
{
	public static void main (String[] args) throws java.lang.Exception
	{
		Scanner s=new Scanner(System.in);
		int n=s.nextInt();
		int a[]=new int[n];
		for(int i=0;i<n;i++)
		      a[i]=s.nextInt();
		if(n==1)
		{
		      System.out.print(0);
		      return ;
		}
		int count=1,max_count=0;
	      for(int i=0;i<n-1;i++)
	      {
	            if(a[i]<=a[i+1])
	                  count++;
	            else
	                  count=1;
	            if(max_count<count)
	                  max_count=count;
	      }
	      System.out.print(max_count);
	}
}


import java.util.*;
import java.lang.*;
import java.io.*;
import java.util.Scanner;

public class Frog
{
	public static void main (String[] args) throws java.lang.Exception
	{
		Scanner s=new Scanner(System.in);
		int n=s.nextInt();
		int a[]=new int[n];
		for(int i=0;i<n;i++)
		      a[i]=s.nextInt();
		if(n==1)
		{
		      System.out.print(1);
		      return ;
		}
		int count=1,max_count=0;
	      for(int i=0;i<n-1;i++)
	      {
	            if(a[i]<=a[i+1])
	                  count++;
	            else
	                  count=1;
	            if(max_count<count)
	                  max_count=count;
	      }
	      System.out.print(max_count);
	}
}


import java.util.Scanner;
public class KefaAndFirstSteps {
        public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int a[]=new int[100000000];
        int s[]=new int[100000000];
        for(int i=0;i<n;i++)
        {
            a[i]=in.nextInt();
        }
        int m=0;
        for(int i =0;i<n;i++)
        {
            if(a[i]<=a[i+1])
            {
                m++;
            }
            else if(a[i]>a[i+1])
            {
                s[i]=m;
                m=0;
            }
        }
        int max=0;
        for(int j=0;j<n;j++)
        {
           if(max<s[j])
           {
               max=s[j];
           }
        }
        System.out.print(max+1);
    }
}


import java.util.Scanner;
public class KefaAndFirstSteps {
        public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int a[]=new int[1000000000];
        int s[]=new int[1000000000];
        for(int i=0;i<n;i++)
        {
            a[i]=in.nextInt();
        }
        int m=0;
        for(int i =0;i<n;i++)
        {
            if(a[i]<=a[i+1])
            {
                m++;
            }
            else if(a[i]>a[i+1])
            {
                s[i]=m;
                m=0;
            }
        }
        int max=0;
        for(int j=0;j<n;j++)
        {
           if(max<s[j])
           {
               max=s[j];
           }
        }
        System.out.print(max+1);
    }
}


import java.util.Scanner;
public class KefaAndFirstSteps {
        public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int a[]=new int[100000];
        int s[]=new int[100000];
        for(int i=0;i<n;i++)
        {
            a[i]=in.nextInt();
        }
        int m=0;
        for(int i =0;i<n;i++)
        {
            if(a[i]<=a[i+1])
            {
                m++;
            }
            else if(a[i]>a[i+1])
            {
                s[i]=m;
                m=0;
            }
        }
        int max=0;
        for(int j=0;j<n;j++)
        {
           if(max<s[j])
           {
               max=s[j];
           }
        }
        System.out.print(max+1);
    }
}


import java.util.Scanner;
public class KefaAndFirstSteps {
        public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int a[]=new int[1000];
        int s[]=new int[1000];
        for(int i=0;i<n;i++)
        {
            a[i]=in.nextInt();
        }
        int m=0;
        for(int i =0;i<n;i++)
        {
            if(a[i]<=a[i+1])
            {
                m++;
            }
            else if(a[i]>a[i+1])
            {
                s[i]=m;
                m=0;
            }
        }
        int max=0;
        for(int j=0;j<n;j++)
        {
           if(max<s[j])
           {
               max=s[j];
           }
        }
        System.out.print(max+1);
    }
}


import java.util.Scanner;
public class KefaAndFirstSteps {
        public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int a[]=new int[1000000];
        int s[]=new int[1000000];
        for(int i=0;i<n;i++)
        {
            a[i]=in.nextInt();
        }
        int m=0;
        for(int i =0;i<n;i++)
        {
            if(a[i]<=a[i+1])
            {
                m++;
            }
            else if(a[i]>a[i+1])
            {
                s[i]=m;
                m=0;
            }
        }
        int max=0;
        for(int j=0;j<n;j++)
        {
           if(max<s[j])
           {
               max=s[j];
           }
        }
        System.out.print(max+1);
    }
}


import java.util.Scanner;
public class KefaAndFirstSteps {
        public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int a[]=new int[10000];
        int s[]=new int[10000];
        for(int i=0;i<n;i++)
        {
            a[i]=in.nextInt();
        }
        int m=0;
        for(int i =0;i<n;i++)
        {
            if(a[i]<=a[i+1])
            {
                m++;
            }
            else if(a[i]>a[i+1])
            {
                s[i]=m;
                m=0;
            }
        }
        int max=0;
        for(int j=0;j<n;j++)
        {
           if(max<s[j])
           {
               max=s[j];
           }
        }
        System.out.print(max+1);
    }
}


import java.util.*;

public class a{
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();

        int a[] = new int[n];

        for(int i=0;i<n;i++){
            a[i] = sc.nextInt();
        }
        int max = 1;
        int current = 0;
        for(int i=1;i<n;i++){
            if(a[i-1] <= a[i]){
                current += 1;
                max = Math.max(max,current);
            }
            else{
                current = 1;
            }

        }
        System.out.println(max);
    }
}


import java.util.*;

public class a{
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();

        int a[] = new int[n];

        for(int i=0;i<n;i++){
            a[i] = sc.nextInt();
        }
        int max = 0;
        int count = 0;
        for(int i=1;i<n;i++){
            if(a[i-1] > a[i]){
                max = 0;
            }
            else{
                count+=1;
                if(count > max){
                    max = count;
                }

            }

        }
        System.out.println(max);
    }
}


import java.util.*;

public class a{
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();

        int a[] = new int[n];

        for(int i=0;i<n;i++){
            a[i] = sc.nextInt();
        }
        int max = 0;
        int count = 0;
        for(int i=1;i<n;i++){
            if(a[i-1] > a[i]){
                count = 0;
            }
            else{
                count+=1;
                if(count > max){
                    max = count;
                }

            }

        }
        System.out.println(count);
    }
}


import java.util.*;

public class a{
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();

        int a[] = new int[n];

        for(int i=0;i<n;i++){
            a[i] = sc.nextInt();
        }
        int max = 0;
        int current = 1;
        if(a.length == 1){
            max = 1;
        }
        for(int i=1;i<n;i++){
            if(a[i-1] <= a[i]){
                current += 1;
                if(current > max){
                max = current;
                }
            }
            else{
                current = 1;
            }

        }
        System.out.println(max);
    }
}