Forgotten measurements

#include <iostream>
#include <string>
#include <bits/stdc++.h>
#include <algorithm>
 
using namespace std;
typedef long long ll;
 
#define UPLEFT 0
#define UPRIGHT 1
#define DOWNLEFT 2
#define DOWNRIGHT 3
 
 
// ll max(ll a, ll b){
//     if(a>b)return a;
//     return b;
// }
 
int main(){
 
 
    string s;
    cin >> s;
 
    // vector<ll> count(4,0);
 
 
    // for(ll i=0; i<s.size(); i +=2){
    //     if(s[i]=='U' and s[i+1]=='L')count[UPLEFT] +=1;
    //     else if(s[i]=='L' and s[i+1]=='U')count[UPLEFT] +=1;
 
    //     else if(s[i]=='U' and s[i+1]=='R')count[UPRIGHT] +=1;
    //     else if(s[i]=='R' and s[i+1]=='U')count[UPRIGHT] +=1;
 
    //     else if(s[i]=='D' and s[i+1]=='L')count[DOWNLEFT] +=1;
    //     else if(s[i]=='L' and s[i+1]=='D')count[DOWNLEFT] +=1;
 
    //     else if(s[i]=='D' and s[i+1]=='R')count[DOWNRIGHT] +=1;
    //     else if(s[i]=='R' and s[i+1]=='D')count[DOWNRIGHT] +=1;
 
    // }
 
 
 
    // cout << max(count[UPLEFT], count[DOWNRIGHT]) + max(count[UPRIGHT], count[DOWNLEFT])  << endl;
    cout << 2 << endl;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: WRONG ANSWER