Go: package main

import (
	"fmt"
	"math"
)

func main() {
	var a, b float64
	fmt.Scanf("%v %v", &a, &b)
	fmt.Println(math.Abs(a - b))
}

C++: #include <iostream>
#include <cmath>
using namespace std;
int main(void){
    // Your code here!
    int a,b;
    cin>>a>>b;
    cout<<abs(a-b)<<endl;
}

C++: #include <iostream>
using namespace std;

int main() {
  int a, b;
  cin >> a >> b;
  cout << ((a>b) ? a-b : b-a) << endl;
  return 0;
}

C++: #include<iostream>
using namespace std;
signed main() {
	int a, b; cin >> a >> b; cout << abs(a - b) << endl;
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
#include <stdlib.h>

using namespace std;

int main(){
  int x1,x2;
  cin>>x1>>x2;
  cout<<abs(x1-x2)<<endl;
}

C++: #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
#include<stdio.h>
#include <cstdint>
using namespace std;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
using ll = long long;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;

int x1, x2;

int main() {

	cin >> x1 >> x2;

	if (x1 > x2)swap(x1, x2);

	cout << x2 - x1 << endl;

	return 0;
}

C++: #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for(int i = int(a); i < int(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
const long long INFLL = 1LL << 60;
const int INFINT = 1 << 30;
const long long MOD = 1e9 + 7;

template <class T> void vecout(T V) {
    auto t = V.begin();
    while(t != V.end()) {
        cout << *t++;
        if(t != V.end()) cout << " ";
    }
    cout << endl;
};

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n, m;
    cin >> n >> m;
    cout << abs(n - m) << endl;
}

C++: #include<iostream>
#define REP(i,n) for(int i=0;i<n;i++)
#define INF 99999999

using namespace std;

int main(void) {
	int x1, x2;
	cin >> x1 >> x2;
	if(x2>x1)cout << x2 - x1 << endl;
	else cout << x1 - x2 << endl;
	return 0;
}

C++: #include <iostream>
#include <cmath>
using namespace std;
int main(void){
    int a,b,c;
    cin>>a>>b;
    c=abs(a-b);
    cout<<c<<endl;
}

C++: #include <iostream>
using namespace std;

int main(){
    long int N,M,num;
    cin >> N >> M;
    
    if(N>M){
        num = N-M;
    }
    else if(M>N){
        num = M-N;
    }
    else{
        num=0;
    }

    cout<<num<<endl;
    return 0;
}

C++: #include <bits/stdc++.h>
#include <assert.h>

using namespace std;

int main()
{
  int x1, x2;
  cin >> x1 >> x2;
  cout << abs(x1 - x2) << endl;

  return 0;
}

C++: #include <iostream>
using namespace std;
int main(void){
    int x1, x2;
    cin >> x1 >> x2;
    if(x1 > x2){
        cout << x1-x2 << endl;
    }
    else{
        cout << x2-x1 << endl;
        
    }
    
    
    

    
}

C++: #include <bits/stdc++.h>

using namespace std;

int main() {
	int x1, x2;

	cin >> x1 >> x2;
	cout << abs(x1 - x2) << endl;

	return 0;
}

C++: #include <iostream>
using namespace std;

int main(){
	int a,b;
	cin >> a >> b;

		if( a >= b )
		{
		cout << a-b << endl;
		}else{
		cout << b-a << endl;    
		}

}

C++: #include <iostream>
#include <fstream>
#include <stdio.h>
#include <math.h>
#include <time.h>
#include <string>
#include <tuple>
#include <vector>
#include <map>
#include <list>
#include <set>
#include <stack>
#include <queue>
#include <cstdlib>
#include <algorithm>
#include <random>
#include <cassert>
using namespace std;
#define LL long long
#undef INT_MIN
#undef INT_MAX
#define INT_MIN -2147483648
#define INT_MAX 2147483647
#define LL_MIN -9223372036854775808
#define LL_MAX 9223372036854775807
#define segment_size 65536
#define ROOP() while (true)

int main(){
    
    int a,b;
    cin >> a >> b;
    cout << abs(a-b) << endl;
    
    return 0;
}

C++: #include <iostream>
using namespace std;
int main(){

int x,y;
cin>>a>>b;

if(a>b) cout<<(a-b)<<endl;
else
cout<<(b-a)<< endl;

return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0;i < n;i++)
#define FOR(i, m, n) for(ll i = m;i < n;i++)

int main() {
  cin.tie(0); ios::sync_with_stdio(false);

  int x, y;
  cin >> x >> y;
  
  cout << abs(x - y) << endl;

}

C++: #include <iostream>
using namespace std;
int main(){
    int a,b;
    cin>>a>>b;
    if(a>b){
        cout<<a-b<<endl;
    }else{
        cout<<b-a<<endl;
    }
}

C++: #include <bits/stdc++.h>
using namespace std;

int main() {
    int x,y;
    cin >> x >> y;
    int ans = abs(x-y);
    cout<<ans<<endl;
}

C++: #include <iostream>

using namespace std;

int main() {
    int x1, x2;
    cin >> x1 >> x2;
    int distance = x1-x2 > 0 ? x1-x2 : x2 - x1;
    cout << distance << endl;
    return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
typedef pair<int, int> P;

int main() {
    int a, b;
    cin >> a >> b;
    cout << abs(a-b) << endl;

    return 0;
}

C++: #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
const int INF=1e9,MOD=1e9+7,ohara=1e6+10;
const ll LINF=1e18;
using namespace std;
    
#define rep(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define rrep(i,a,b) for(int i=(a);i<(b);i++)
#define rrrep(i,a,b) for(int i=(a);i>=(b);i--)
#define all(v) (v).begin(), (v).end()
#define Size(n) (n).size()
#define Cout(x) cout<<(x)<<endl
#define doublecout(a) cout<<fixed<<setprecision(15)<<a<<endl;
#define Cerr(x) cerr<<(x)<<endl
#define fi first
#define se second
#define P pair<ll,ll> 
#define m_p make_pair
#define V vector<ll> 
#define U_MAP unordered_map<ll,ll>
#define pq priority_queue<ll>
#define rpq priority_queue<ll,vector<ll>,greater<ll>>
#define p_b push_back
    
ll n,cnt,ans,a,b,c,d,tmp,tmpp,m,h,w,x,y,sum,pos,k;
ld doua;
int dy[]={1,0,-1,0};
int dx[]={0,1,0,-1};
//int dy[]={-1,0,1,-1,1,-1,0,1};
//int dx[]={-1,-1,-1,0,0,1,1,1};
string alph("abcdefghijklmnopqrstuvwxyz"),s;
bool fl;
struct edge{int to,cost;};
    
//-------------------------↓↓↓↓↓↓------------------------
    
//------ 自分を天才だと信じる ------
    
int main(void){
    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(false);
    
    cin>>a>>b;
    Cout(abs(a-b));
    return 0;
}

C++: #include <iostream>
using namespace std;
int main(){

 	int x1 , x2 ;
	cin >> x1 >> x2 ;
	if (a < b ) cout << b - a <<endl ;
	cout << a - b << endl ;

return 0;
}

C++: #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define INF (1<<30)
#define INFLL (1ll<<60)
typedef pair<int, int> P;
typedef pair<int, P> E;
#define MOD (1000000007ll)
#define l_ength size

void mul_mod(ll& a, ll b){
	a *= b;
	a %= MOD;
}

void add_mod(ll& a, ll b){
	b += MOD;
	a += b;
	a %= MOD;
}

int main(void){
	int x,y;
	cin >> x >> y;
	cout << (abs(x-y)) << endl;
	return 0;
}

C++: #include<iostream>
#include<string>

using namespace std;

int main()
{
	int a,b;

	cin >> a>>b;

	if (a >= b)
	{
		cout << a - b << endl;
	}
	else
	{
		cout << b - a << endl;
	}
	
	return 0;
}

C++: #include <iostream>
#include <algorithm>

using namespace std;

int main() {
    int x, y;
    cin >> x >> y;
    cout << abs(x - y) << endl;
    return 0;
}