func_code_string: #include <bits/stdc++.h>   using namespace std;   template <typename T, typename U>   inline void smin(T &a, U b) {     if (a > b) a = b;   }   template <typename T, typename U>   inline void smax(T &a, U b) {     if (a < b) a = b;   }   template <typename T>   inline void gn(T &first) {     char c, sg = 0;     while (c = getchar(), (c >  9  || c <  0 ) && c !=  - )       ;     for ((c ==  -  ? sg = 1, c = getchar() : 0), first = 0; c >=  0  && c <=  9 ;          c = getchar())       first = (first << 1) + (first << 3) + c -  0 ;     if (sg) first = -first;   }   template <class T, class T1>   inline void gn(T &first, T1 &second) {     gn(first);     gn(second);   }   template <class T, class T1, class T2>   inline void gn(T &first, T1 &second, T2 &z) {     gn(first);     gn(second);     gn(z);   }   template <typename T>   inline void print(T first) {     if (first < 0) {       putchar( - );       return print(-first);     }     if (first < 10) {       putchar( 0  + first);       return;     }     print(first / 10);     putchar(first % 10 +  0 );   }   template <typename T>   inline void println(T first) {     print(first), putchar(  n );   }   template <typename T>   inline void printsp(T first) {     print(first), putchar(   );   }   template <class T, class T1>   inline void print(T first, T1 second) {     printsp(first), println(second);   }   template <class T, class T1, class T2>   inline void print(T first, T1 second, T2 z) {     printsp(first), printsp(second), println(z);   }   int power(int a, int b, int m, int ans = 1) {     for (; b; b >>= 1, a = 1LL * a * a % m)       if (b & 1) ans = 1LL * ans * a % m;     return ans;   }   int main() {     int n;     gn(n);     if (n == 3) {       puts( >vv );       puts( ^<. );       puts( ^.< );       puts( 1 3 );       return 0;     }     if (n == 5) {       puts( >...v );       puts( v.<.. );       puts( ..^.. );       puts( >.... );       puts( ..^.< );       puts( 1 1 );       return 0;     }     for (int i = 1; i <= n; i++) {       for (int j = 1; j <= n; j++) {         if (i == 1) {           if (j == n)             putchar( v );           else if (j <= n / 3)             putchar( > );           else if (j - n / 3 & 1)             putchar( > );           else             putchar( . );           continue;         }         if (i == n) {           if (j == 1)             putchar( ^ );           else if (j > n - n / 3)             putchar( < );           else if (n - n / 3 - j & 1)             putchar( < );           else             putchar( . );           continue;         }         if (j == 1) {           putchar( ^ );           continue;         }         if (i & 1) {           if (j == n)             putchar( v );           else if (j <= n / 3)             putchar( > );           else if (j - n / 3 & 1)             putchar( > );           else             putchar( . );         } else {           if (j == 2)             putchar( v );           else if (j > n - n / 3)             putchar( < );           else if (j & 1)             putchar( < );           else             putchar( . );         }       }       puts(  );     }     puts( 1 1 );     return 0;   }   