You are given arrays A and B of N integers. Alexa decided to choose a subsequence of indices i\u2081 < i\u2082 < ,..., < i such that\n* A[i\u2081] <= A[i\u2082] <= ... <= A[i\u2096]\n* The sum (A[i\u2081] + B[i\u2081]) + (A[i\u2082] - B[i\u2082]) + ... + (A[i\u2096] + (-1)\u1D4F\u207B\xB9B[i\u2096]) is maximum possible\n\nFind Maximum possible sum that Alexa can get. Answer it in modulo 10\u2079 + 7\n\n**Example**\n```\nN - 6\nA - 4 6 4 1 3 3\nB - 5 7 6 0 3 2\nOUTPUT : 13\n```\nChoose index 2\n\n**Example**\n```\n6\n5 2 7 2 5 3\n-6 7 -3 7 5 6\nOUTPUT : 19\n```\nChoose index 2, 3\nResult will be (A[2] + B[2]) + (A[3] - B[3])\n

You are given arrays A and B of N integers. Alexa decided to choose a subsequence of indices i\u2081 < i\u2082 < ,..., < i such that\n A[i\u2081] <= A[i\u2082] 