
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		@SuppressWarnings("resource")
		Scanner scanner = new Scanner(System.in);

//		int N = scanner.nextInt();
//
//		int K = scanner.nextInt();

		int N = scanner.nextInt();

		int ans=0;
		int max=0;

		int[] arrayH = new int[N];

		for(int index = 0; index < N; index++) {
			arrayH[index] = scanner.nextInt();
		}

		for (int index = 1; index < N; index++) {

			if(arrayH[index - 1] >= arrayH[index]) {
				max++;
				if(ans < max) {
					ans = max;
				}
			} else {
				max =0;
			}
		}


		log(ans);

//		int[] scannerArray = new int[N];
//
//		for (int index = 0; index < N; index++) {
//			scannerArray[index] = scanner.nextInt();
//		}
//
//		int tmp = countSwapBabbleSort(scannerArray);
//
//		log((
//				(BigInteger.valueOf((long)tmp)
//				.multiply(BigInteger.valueOf((long)K)
//						))
//				.add((
//						BigInteger.valueOf((long)tmp)
//						.multiply(
//								BigInteger.valueOf((long)K)
//								.multiply(
//										BigInteger.valueOf((long)K)
//										.subtract(BigInteger.ONE)
//										)
//								.divide(BigInteger.valueOf((long)2)
//										)
//								)
//						)))
//				.remainder(
//						BigInteger.valueOf((long)1000000007)
//						)
//				.toString());
	}


	/**
	 * バブルソートの交換数を算出
	 * ※転倒数
	 * @param array
	 * @return
	 */
	private static int countSwapBabbleSort(int[] array) {
		int ans = 0;
		int[] binary = new int[array.length + 1];

		for (int index = 0; index < array.length; index++) {
			ans = ans + (index - sum(binary, array[index]));
			add(binary, array[index], 1);
		}
		return ans;
	}

    //add value at idx on bit O(logN)
	private static void add(int[] bit,int idx,int value) {
        for(int i=idx;i<bit.length;i=i+(i&-i)) {
        	bit[i] += value;
        }
    }

    //return sum [1,idx] O(logN)
	private static int sum(int[] bit,int idx) {
        int ret = 0;
        for(int i=idx;i>0;i-=(i&-i)) {
        	ret += bit[i];
        }
        return ret;
    }

	private static void log(String str) {
		System.out.println(str);
	}

	private static void log(int str) {
		System.out.println(str);
	}

	private static void log(double str) {
		System.out.println(str);
	}

}
 import java.util.Scanner; Scanner java.util public class Main {
	public static void main(String[] args) {
		@SuppressWarnings("resource")
		Scanner scanner = new Scanner(System.in);

//		int N = scanner.nextInt();
//
//		int K = scanner.nextInt();

		int N = scanner.nextInt();

		int ans=0;
		int max=0;

		int[] arrayH = new int[N];

		for(int index = 0; index < N; index++) {
			arrayH[index] = scanner.nextInt();
		}

		for (int index = 1; index < N; index++) {

			if(arrayH[index - 1] >= arrayH[index]) {
				max++;
				if(ans < max) {
					ans = max;
				}
			} else {
				max =0;
			}
		}


		log(ans);

//		int[] scannerArray = new int[N];
//
//		for (int index = 0; index < N; index++) {
//			scannerArray[index] = scanner.nextInt();
//		}
//
//		int tmp = countSwapBabbleSort(scannerArray);
//
//		log((
//				(BigInteger.valueOf((long)tmp)
//				.multiply(BigInteger.valueOf((long)K)
//						))
//				.add((
//						BigInteger.valueOf((long)tmp)
//						.multiply(
//								BigInteger.valueOf((long)K)
//								.multiply(
//										BigInteger.valueOf((long)K)
//										.subtract(BigInteger.ONE)
//										)
//								.divide(BigInteger.valueOf((long)2)
//										)
//								)
//						)))
//				.remainder(
//						BigInteger.valueOf((long)1000000007)
//						)
//				.toString());
	}


	/**
	 * バブルソートの交換数を算出
	 * ※転倒数
	 * @param array
	 * @return
	 */
	private static int countSwapBabbleSort(int[] array) {
		int ans = 0;
		int[] binary = new int[array.length + 1];

		for (int index = 0; index < array.length; index++) {
			ans = ans + (index - sum(binary, array[index]));
			add(binary, array[index], 1);
		}
		return ans;
	}

    //add value at idx on bit O(logN)
	private static void add(int[] bit,int idx,int value) {
        for(int i=idx;i<bit.length;i=i+(i&-i)) {
        	bit[i] += value;
        }
    }

    //return sum [1,idx] O(logN)
	private static int sum(int[] bit,int idx) {
        int ret = 0;
        for(int i=idx;i>0;i-=(i&-i)) {
        	ret += bit[i];
        }
        return ret;
    }

	private static void log(String str) {
		System.out.println(str);
	}

	private static void log(int str) {
		System.out.println(str);
	}

	private static void log(double str) {
		System.out.println(str);
	}

} Main public static void main(String[] args) {
		@SuppressWarnings("resource")
		Scanner scanner = new Scanner(System.in);

//		int N = scanner.nextInt();
//
//		int K = scanner.nextInt();

		int N = scanner.nextInt();

		int ans=0;
		int max=0;

		int[] arrayH = new int[N];

		for(int index = 0; index < N; index++) {
			arrayH[index] = scanner.nextInt();
		}

		for (int index = 1; index < N; index++) {

			if(arrayH[index - 1] >= arrayH[index]) {
				max++;
				if(ans < max) {
					ans = max;
				}
			} else {
				max =0;
			}
		}


		log(ans);

//		int[] scannerArray = new int[N];
//
//		for (int index = 0; index < N; index++) {
//			scannerArray[index] = scanner.nextInt();
//		}
//
//		int tmp = countSwapBabbleSort(scannerArray);
//
//		log((
//				(BigInteger.valueOf((long)tmp)
//				.multiply(BigInteger.valueOf((long)K)
//						))
//				.add((
//						BigInteger.valueOf((long)tmp)
//						.multiply(
//								BigInteger.valueOf((long)K)
//								.multiply(
//										BigInteger.valueOf((long)K)
//										.subtract(BigInteger.ONE)
//										)
//								.divide(BigInteger.valueOf((long)2)
//										)
//								)
//						)))
//				.remainder(
//						BigInteger.valueOf((long)1000000007)
//						)
//				.toString());
	} main {
		@SuppressWarnings("resource")
		Scanner scanner = new Scanner(System.in);

//		int N = scanner.nextInt();
//
//		int K = scanner.nextInt();

		int N = scanner.nextInt();

		int ans=0;
		int max=0;

		int[] arrayH = new int[N];

		for(int index = 0; index < N; index++) {
			arrayH[index] = scanner.nextInt();
		}

		for (int index = 1; index < N; index++) {

			if(arrayH[index - 1] >= arrayH[index]) {
				max++;
				if(ans < max) {
					ans = max;
				}
			} else {
				max =0;
			}
		}


		log(ans);

//		int[] scannerArray = new int[N];
//
//		for (int index = 0; index < N; index++) {
//			scannerArray[index] = scanner.nextInt();
//		}
//
//		int tmp = countSwapBabbleSort(scannerArray);
//
//		log((
//				(BigInteger.valueOf((long)tmp)
//				.multiply(BigInteger.valueOf((long)K)
//						))
//				.add((
//						BigInteger.valueOf((long)tmp)
//						.multiply(
//								BigInteger.valueOf((long)K)
//								.multiply(
//										BigInteger.valueOf((long)K)
//										.subtract(BigInteger.ONE)
//										)
//								.divide(BigInteger.valueOf((long)2)
//										)
//								)
//						)))
//				.remainder(
//						BigInteger.valueOf((long)1000000007)
//						)
//				.toString());
	} @SuppressWarnings("resource")
		Scanner scanner = new Scanner(System.in); scanner new Scanner(System.in) int N = scanner.nextInt(); N scanner.nextInt() scanner.nextInt scanner int ans=0; ans 0 int max=0; max 0 int[] arrayH = new int[N]; arrayH new int[N] N for(int index = 0; index < N; index++) {
			arrayH[index] = scanner.nextInt();
		} int index = 0; int index = 0; index 0 index < N index N index++ index++ index {
			arrayH[index] = scanner.nextInt();
		} {
			arrayH[index] = scanner.nextInt();
		} arrayH[index] = scanner.nextInt() arrayH[index] arrayH index scanner.nextInt() scanner.nextInt scanner for (int index = 1; index < N; index++) {

			if(arrayH[index - 1] >= arrayH[index]) {
				max++;
				if(ans < max) {
					ans = max;
				}
			} else {
				max =0;
			}
		} int index = 1; int index = 1; index 1 index < N index N index++ index++ index {

			if(arrayH[index - 1] >= arrayH[index]) {
				max++;
				if(ans < max) {
					ans = max;
				}
			} else {
				max =0;
			}
		} {

			if(arrayH[index - 1] >= arrayH[index]) {
				max++;
				if(ans < max) {
					ans = max;
				}
			} else {
				max =0;
			}
		} if(arrayH[index - 1] >= arrayH[index]) {
				max++;
				if(ans < max) {
					ans = max;
				}
			} else {
				max =0;
			} arrayH[index - 1] >= arrayH[index] arrayH[index - 1] arrayH index - 1 index 1 arrayH[index] arrayH index {
				max++;
				if(ans < max) {
					ans = max;
				}
			} max++ max if(ans < max) {
					ans = max;
				} ans < max ans max {
					ans = max;
				} ans = max ans max {
				max =0;
			} max =0 max 0 log(ans) log ans String[] args args /**
	 * バブルソートの交換数を算出
	 * ※転倒数
	 * @param array
	 * @return
	 */
	private static int countSwapBabbleSort(int[] array) {
		int ans = 0;
		int[] binary = new int[array.length + 1];

		for (int index = 0; index < array.length; index++) {
			ans = ans + (index - sum(binary, array[index]));
			add(binary, array[index], 1);
		}
		return ans;
	} countSwapBabbleSort {
		int ans = 0;
		int[] binary = new int[array.length + 1];

		for (int index = 0; index < array.length; index++) {
			ans = ans + (index - sum(binary, array[index]));
			add(binary, array[index], 1);
		}
		return ans;
	} int ans = 0; ans 0 int[] binary = new int[array.length + 1]; binary new int[array.length + 1] array.length + 1 array.length array array.length 1 for (int index = 0; index < array.length; index++) {
			ans = ans + (index - sum(binary, array[index]));
			add(binary, array[index], 1);
		} int index = 0; int index = 0; index 0 index < array.length index array.length array array.length index++ index++ index {
			ans = ans + (index - sum(binary, array[index]));
			add(binary, array[index], 1);
		} {
			ans = ans + (index - sum(binary, array[index]));
			add(binary, array[index], 1);
		} ans = ans + (index - sum(binary, array[index])) ans ans + (index - sum(binary, array[index])) ans (index - sum(binary, array[index])) index sum(binary, array[index]) sum binary array[index] array index add(binary, array[index], 1) add binary array[index] array index 1 return ans; ans int[] array array //add value at idx on bit O(logN)
	private static void add(int[] bit,int idx,int value) {
        for(int i=idx;i<bit.length;i=i+(i&-i)) {
        	bit[i] += value;
        }
    } add {
        for(int i=idx;i<bit.length;i=i+(i&-i)) {
        	bit[i] += value;
        }
    } for(int i=idx;i<bit.length;i=i+(i&-i)) {
        	bit[i] += value;
        } int i=idx; int i=idx; i idx i<bit.length i bit.length bit bit.length i=i+(i&-i) i=i+(i&-i) i i+(i&-i) i (i&-i) i -i i {
        	bit[i] += value;
        } {
        	bit[i] += value;
        } bit[i] += value bit[i] bit i value int[] bit bit int idx idx int value value //return sum [1,idx] O(logN)
	private static int sum(int[] bit,int idx) {
        int ret = 0;
        for(int i=idx;i>0;i-=(i&-i)) {
        	ret += bit[i];
        }
        return ret;
    } sum {
        int ret = 0;
        for(int i=idx;i>0;i-=(i&-i)) {
        	ret += bit[i];
        }
        return ret;
    } int ret = 0; ret 0 for(int i=idx;i>0;i-=(i&-i)) {
        	ret += bit[i];
        } int i=idx; int i=idx; i idx i>0 i 0 i-=(i&-i) i-=(i&-i) i (i&-i) i -i i {
        	ret += bit[i];
        } {
        	ret += bit[i];
        } ret += bit[i] ret bit[i] bit i return ret; ret int[] bit bit int idx idx private static void log(String str) {
		System.out.println(str);
	} log {
		System.out.println(str);
	} System.out.println(str) System.out.println System.out System System.out str String str str private static void log(int str) {
		System.out.println(str);
	} log {
		System.out.println(str);
	} System.out.println(str) System.out.println System.out System System.out str int str str private static void log(double str) {
		System.out.println(str);
	} log {
		System.out.println(str);
	} System.out.println(str) System.out.println System.out System System.out str double str str public class Main {
	public static void main(String[] args) {
		@SuppressWarnings("resource")
		Scanner scanner = new Scanner(System.in);

//		int N = scanner.nextInt();
//
//		int K = scanner.nextInt();

		int N = scanner.nextInt();

		int ans=0;
		int max=0;

		int[] arrayH = new int[N];

		for(int index = 0; index < N; index++) {
			arrayH[index] = scanner.nextInt();
		}

		for (int index = 1; index < N; index++) {

			if(arrayH[index - 1] >= arrayH[index]) {
				max++;
				if(ans < max) {
					ans = max;
				}
			} else {
				max =0;
			}
		}


		log(ans);

//		int[] scannerArray = new int[N];
//
//		for (int index = 0; index < N; index++) {
//			scannerArray[index] = scanner.nextInt();
//		}
//
//		int tmp = countSwapBabbleSort(scannerArray);
//
//		log((
//				(BigInteger.valueOf((long)tmp)
//				.multiply(BigInteger.valueOf((long)K)
//						))
//				.add((
//						BigInteger.valueOf((long)tmp)
//						.multiply(
//								BigInteger.valueOf((long)K)
//								.multiply(
//										BigInteger.valueOf((long)K)
//										.subtract(BigInteger.ONE)
//										)
//								.divide(BigInteger.valueOf((long)2)
//										)
//								)
//						)))
//				.remainder(
//						BigInteger.valueOf((long)1000000007)
//						)
//				.toString());
	}


	/**
	 * バブルソートの交換数を算出
	 * ※転倒数
	 * @param array
	 * @return
	 */
	private static int countSwapBabbleSort(int[] array) {
		int ans = 0;
		int[] binary = new int[array.length + 1];

		for (int index = 0; index < array.length; index++) {
			ans = ans + (index - sum(binary, array[index]));
			add(binary, array[index], 1);
		}
		return ans;
	}

    //add value at idx on bit O(logN)
	private static void add(int[] bit,int idx,int value) {
        for(int i=idx;i<bit.length;i=i+(i&-i)) {
        	bit[i] += value;
        }
    }

    //return sum [1,idx] O(logN)
	private static int sum(int[] bit,int idx) {
        int ret = 0;
        for(int i=idx;i>0;i-=(i&-i)) {
        	ret += bit[i];
        }
        return ret;
    }

	private static void log(String str) {
		System.out.println(str);
	}

	private static void log(int str) {
		System.out.println(str);
	}

	private static void log(double str) {
		System.out.println(str);
	}

} public class Main {
	public static void main(String[] args) {
		@SuppressWarnings("resource")
		Scanner scanner = new Scanner(System.in);

//		int N = scanner.nextInt();
//
//		int K = scanner.nextInt();

		int N = scanner.nextInt();

		int ans=0;
		int max=0;

		int[] arrayH = new int[N];

		for(int index = 0; index < N; index++) {
			arrayH[index] = scanner.nextInt();
		}

		for (int index = 1; index < N; index++) {

			if(arrayH[index - 1] >= arrayH[index]) {
				max++;
				if(ans < max) {
					ans = max;
				}
			} else {
				max =0;
			}
		}


		log(ans);

//		int[] scannerArray = new int[N];
//
//		for (int index = 0; index < N; index++) {
//			scannerArray[index] = scanner.nextInt();
//		}
//
//		int tmp = countSwapBabbleSort(scannerArray);
//
//		log((
//				(BigInteger.valueOf((long)tmp)
//				.multiply(BigInteger.valueOf((long)K)
//						))
//				.add((
//						BigInteger.valueOf((long)tmp)
//						.multiply(
//								BigInteger.valueOf((long)K)
//								.multiply(
//										BigInteger.valueOf((long)K)
//										.subtract(BigInteger.ONE)
//										)
//								.divide(BigInteger.valueOf((long)2)
//										)
//								)
//						)))
//				.remainder(
//						BigInteger.valueOf((long)1000000007)
//						)
//				.toString());
	}


	/**
	 * バブルソートの交換数を算出
	 * ※転倒数
	 * @param array
	 * @return
	 */
	private static int countSwapBabbleSort(int[] array) {
		int ans = 0;
		int[] binary = new int[array.length + 1];

		for (int index = 0; index < array.length; index++) {
			ans = ans + (index - sum(binary, array[index]));
			add(binary, array[index], 1);
		}
		return ans;
	}

    //add value at idx on bit O(logN)
	private static void add(int[] bit,int idx,int value) {
        for(int i=idx;i<bit.length;i=i+(i&-i)) {
        	bit[i] += value;
        }
    }

    //return sum [1,idx] O(logN)
	private static int sum(int[] bit,int idx) {
        int ret = 0;
        for(int i=idx;i>0;i-=(i&-i)) {
        	ret += bit[i];
        }
        return ret;
    }

	private static void log(String str) {
		System.out.println(str);
	}

	private static void log(int str) {
		System.out.println(str);
	}

	private static void log(double str) {
		System.out.println(str);
	}

} Main

import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		@SuppressWarnings("resource")
		Scanner scanner = new Scanner(System.in);

//		int N = scanner.nextInt();
//
//		int K = scanner.nextInt();

		int N = scanner.nextInt();

		int ans=0;
		int max=0;

		int[] arrayH = new int[N];

		for(int index = 0; index < N; index++) {
			arrayH[index] = scanner.nextInt();
		}

		for (int index = 1; index < N; index++) {

			if(arrayH[index - 1] >= arrayH[index]) {
				max++;
				if(ans < max) {
					ans = max;
				}
			} else {
				max =0;
			}
		}


		log(ans);

//		int[] scannerArray = new int[N];
//
//		for (int index = 0; index < N; index++) {
//			scannerArray[index] = scanner.nextInt();
//		}
//
//		int tmp = countSwapBabbleSort(scannerArray);
//
//		log((
//				(BigInteger.valueOf((long)tmp)
//				.multiply(BigInteger.valueOf((long)K)
//						))
//				.add((
//						BigInteger.valueOf((long)tmp)
//						.multiply(
//								BigInteger.valueOf((long)K)
//								.multiply(
//										BigInteger.valueOf((long)K)
//										.subtract(BigInteger.ONE)
//										)
//								.divide(BigInteger.valueOf((long)2)
//										)
//								)
//						)))
//				.remainder(
//						BigInteger.valueOf((long)1000000007)
//						)
//				.toString());
	}


	/**
	 * バブルソートの交換数を算出
	 * ※転倒数
	 * @param array
	 * @return
	 */
	private static int countSwapBabbleSort(int[] array) {
		int ans = 0;
		int[] binary = new int[array.length + 1];

		for (int index = 0; index < array.length; index++) {
			ans = ans + (index - sum(binary, array[index]));
			add(binary, array[index], 1);
		}
		return ans;
	}

    //add value at idx on bit O(logN)
	private static void add(int[] bit,int idx,int value) {
        for(int i=idx;i<bit.length;i=i+(i&-i)) {
        	bit[i] += value;
        }
    }

    //return sum [1,idx] O(logN)
	private static int sum(int[] bit,int idx) {
        int ret = 0;
        for(int i=idx;i>0;i-=(i&-i)) {
        	ret += bit[i];
        }
        return ret;
    }

	private static void log(String str) {
		System.out.println(str);
	}

	private static void log(int str) {
		System.out.println(str);
	}

	private static void log(double str) {
		System.out.println(str);
	}

}

