#include <iostream>

 #include <cstdio>

 #include <cstring>

 #include <algorithm>

 #include <string>

 #include <vector>

 #include <set>

 #include <map>

 #include <stack>

 #include <queue>

 #include <list>

 #include <cstdlib>

 #include <cmath>

 #define FRER() freopen("in.txt", "r", stdin)

 #define FREO() freopen("out.txt", "w", stdout)

 #define INF 0x3f3f3f3f

 using namespace std;

 const int maxn =  + ;

 int n, cx[maxn], cy[maxn], x, y;

 char str[maxn];

 bool judge(int t) {

     for(int i = t; i <= n; ++i) {

         int lx = cx[n] - cx[i] + cx[i - t];

         int ly = cy[n] - cy[i] + cy[i - t];

         if (abs(x - lx) + abs(y - ly) <= t)

             return true;

     }

     return false;

 }

 int main()

 {

     cin >> n >> str >> x >> y;

     if(abs(x) + abs(y) > n || (abs(x) + abs(y)) %  != n % ) {

         cout << - << endl;

     }

     else {

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

             if(str[i] == 'U') cx[i + ] = cx[i], cy[i + ] = cy[i] + ;

             else if(str[i] == 'D') cx[i + ] = cx[i], cy[i + ] = cy[i] - ;

             else if(str[i] == 'L') cx[i + ] = cx[i] - , cy[i + ] = cy[i];

             else if(str[i] == 'R') cx[i + ] = cx[i] + , cy[i + ] = cy[i];

         }

         int l = , r = n;

         while(l < r) {

             int m = (l + r) >> ;

             if(judge(m))

                 r = m;

             else

                 l = m + ;

         }

         cout << r << endl;

     }

     return ;

 }