import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Scanner;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main
{
    public static void main(String[] args)
    {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskA solver = new TaskA();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskA
    {
        public void solve(int testNumber, Scanner in, PrintWriter out)
        {
            int n = in.nextInt();
            int h[] = new int[n];
            for (int i = 0; i < n; i++)
            {
                h[i] = in.nextInt();
            }
            int max = 0;
            int localMax = 0;
            int current = h[0];
            for (int i = 1; i < h.length; i++)
            {
                if (current < h[i])
                {
                    max = Math.max(max, localMax);
                    localMax = 0;
                } else
                {
                    localMax++;
                }
                current = h[i];
            }
            max = Math.max(max, localMax);
            out.print(max);
        }

    }
}
 import java.io.OutputStream; OutputStream java.io import java.io.IOException; IOException java.io import java.io.InputStream; InputStream java.io import java.io.PrintWriter; PrintWriter java.io import java.util.Scanner; Scanner java.util public class Main
{
    public static void main(String[] args)
    {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskA solver = new TaskA();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskA
    {
        public void solve(int testNumber, Scanner in, PrintWriter out)
        {
            int n = in.nextInt();
            int h[] = new int[n];
            for (int i = 0; i < n; i++)
            {
                h[i] = in.nextInt();
            }
            int max = 0;
            int localMax = 0;
            int current = h[0];
            for (int i = 1; i < h.length; i++)
            {
                if (current < h[i])
                {
                    max = Math.max(max, localMax);
                    localMax = 0;
                } else
                {
                    localMax++;
                }
                current = h[i];
            }
            max = Math.max(max, localMax);
            out.print(max);
        }

    }
} Main public static void main(String[] args)
    {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskA solver = new TaskA();
        solver.solve(1, in, out);
        out.close();
    } main {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskA solver = new TaskA();
        solver.solve(1, in, out);
        out.close();
    } InputStream inputStream = System.in; inputStream System.in System System.in OutputStream outputStream = System.out; outputStream System.out System System.out Scanner in = new Scanner(inputStream); in new Scanner(inputStream) PrintWriter out = new PrintWriter(outputStream); out new PrintWriter(outputStream) TaskA solver = new TaskA(); solver new TaskA() solver.solve(1, in, out) solver.solve solver 1 in out out.close() out.close out String[] args args static class TaskA
    {
        public void solve(int testNumber, Scanner in, PrintWriter out)
        {
            int n = in.nextInt();
            int h[] = new int[n];
            for (int i = 0; i < n; i++)
            {
                h[i] = in.nextInt();
            }
            int max = 0;
            int localMax = 0;
            int current = h[0];
            for (int i = 1; i < h.length; i++)
            {
                if (current < h[i])
                {
                    max = Math.max(max, localMax);
                    localMax = 0;
                } else
                {
                    localMax++;
                }
                current = h[i];
            }
            max = Math.max(max, localMax);
            out.print(max);
        }

    } TaskA public void solve(int testNumber, Scanner in, PrintWriter out)
        {
            int n = in.nextInt();
            int h[] = new int[n];
            for (int i = 0; i < n; i++)
            {
                h[i] = in.nextInt();
            }
            int max = 0;
            int localMax = 0;
            int current = h[0];
            for (int i = 1; i < h.length; i++)
            {
                if (current < h[i])
                {
                    max = Math.max(max, localMax);
                    localMax = 0;
                } else
                {
                    localMax++;
                }
                current = h[i];
            }
            max = Math.max(max, localMax);
            out.print(max);
        } solve {
            int n = in.nextInt();
            int h[] = new int[n];
            for (int i = 0; i < n; i++)
            {
                h[i] = in.nextInt();
            }
            int max = 0;
            int localMax = 0;
            int current = h[0];
            for (int i = 1; i < h.length; i++)
            {
                if (current < h[i])
                {
                    max = Math.max(max, localMax);
                    localMax = 0;
                } else
                {
                    localMax++;
                }
                current = h[i];
            }
            max = Math.max(max, localMax);
            out.print(max);
        } int n = in.nextInt(); n in.nextInt() in.nextInt in int h[] = new int[n]; h new int[n] n for (int i = 0; i < n; i++)
            {
                h[i] = in.nextInt();
            } int i = 0; int i = 0; i 0 i < n i n i++ i++ i {
                h[i] = in.nextInt();
            } {
                h[i] = in.nextInt();
            } h[i] = in.nextInt() h[i] h i in.nextInt() in.nextInt in int max = 0; max 0 int localMax = 0; localMax 0 int current = h[0]; current h[0] h 0 for (int i = 1; i < h.length; i++)
            {
                if (current < h[i])
                {
                    max = Math.max(max, localMax);
                    localMax = 0;
                } else
                {
                    localMax++;
                }
                current = h[i];
            } int i = 1; int i = 1; i 1 i < h.length i h.length h h.length i++ i++ i {
                if (current < h[i])
                {
                    max = Math.max(max, localMax);
                    localMax = 0;
                } else
                {
                    localMax++;
                }
                current = h[i];
            } {
                if (current < h[i])
                {
                    max = Math.max(max, localMax);
                    localMax = 0;
                } else
                {
                    localMax++;
                }
                current = h[i];
            } if (current < h[i])
                {
                    max = Math.max(max, localMax);
                    localMax = 0;
                } else
                {
                    localMax++;
                } current < h[i] current h[i] h i {
                    max = Math.max(max, localMax);
                    localMax = 0;
                } max = Math.max(max, localMax) max Math.max(max, localMax) Math.max Math max localMax localMax = 0 localMax 0 {
                    localMax++;
                } localMax++ localMax current = h[i] current h[i] h i max = Math.max(max, localMax) max Math.max(max, localMax) Math.max Math max localMax out.print(max) out.print out max int testNumber testNumber Scanner in in PrintWriter out out public class Main
{
    public static void main(String[] args)
    {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskA solver = new TaskA();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskA
    {
        public void solve(int testNumber, Scanner in, PrintWriter out)
        {
            int n = in.nextInt();
            int h[] = new int[n];
            for (int i = 0; i < n; i++)
            {
                h[i] = in.nextInt();
            }
            int max = 0;
            int localMax = 0;
            int current = h[0];
            for (int i = 1; i < h.length; i++)
            {
                if (current < h[i])
                {
                    max = Math.max(max, localMax);
                    localMax = 0;
                } else
                {
                    localMax++;
                }
                current = h[i];
            }
            max = Math.max(max, localMax);
            out.print(max);
        }

    }
} public class Main
{
    public static void main(String[] args)
    {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskA solver = new TaskA();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskA
    {
        public void solve(int testNumber, Scanner in, PrintWriter out)
        {
            int n = in.nextInt();
            int h[] = new int[n];
            for (int i = 0; i < n; i++)
            {
                h[i] = in.nextInt();
            }
            int max = 0;
            int localMax = 0;
            int current = h[0];
            for (int i = 1; i < h.length; i++)
            {
                if (current < h[i])
                {
                    max = Math.max(max, localMax);
                    localMax = 0;
                } else
                {
                    localMax++;
                }
                current = h[i];
            }
            max = Math.max(max, localMax);
            out.print(max);
        }

    }
} Main
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Scanner;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main
{
    public static void main(String[] args)
    {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskA solver = new TaskA();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskA
    {
        public void solve(int testNumber, Scanner in, PrintWriter out)
        {
            int n = in.nextInt();
            int h[] = new int[n];
            for (int i = 0; i < n; i++)
            {
                h[i] = in.nextInt();
            }
            int max = 0;
            int localMax = 0;
            int current = h[0];
            for (int i = 1; i < h.length; i++)
            {
                if (current < h[i])
                {
                    max = Math.max(max, localMax);
                    localMax = 0;
                } else
                {
                    localMax++;
                }
                current = h[i];
            }
            max = Math.max(max, localMax);
            out.print(max);
        }

    }
}

