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>
using namespace std;

int main()
{

int  x1, x2;
cin>> x1>> x2;

	if( x1<x2 )cout<< x2-x1<<endl;
	else
	cout<< x1-x2<<endl;

return 0;
}

C++: #include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main() {
	int x, y;
	cin >> x >> y;
	cout << abs(x - y) << endl;
}

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

using namespace std;
using llong = long long;
using ldbl = long double;
using P = pair<llong, llong>;

#define BE(x) x.begin(), x.end()

const llong inf = llong(1e18)+7;
const llong mod = 1e9+7;

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

	cout << abs(a-b) << endl;

	return 0;
}

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

C++: #include<bits/stdc++.h>
using namespace std;
using Int = long long;
//INSERT ABOVE HERE
signed main(){
  Int x,y;
  cin>>x>>y;
  cout<<abs(x-y)<<endl;
  return 0;
}

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

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

int main() {
  int x1, x2;
  cin >> x1 >> x2;

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

  return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
int main(){
    int x,y;
    cin >> x >> y;
    cout << max(x,y)-min(x,y) << endl;
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <stack>
#include <istream>
#include <map>
#include <set>
#include <queue>
#define rep0(i,n) for (int i = 0; i <= (n); ++i)
#define rep1(i,n) for (int i = 1; i <= (n); ++i)
#define REP(a,b) for (int i = a; i <= (b); ++i) 
using namespace std;
int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
//
	int a, b;
	cin >> a >> b;
	cout << abs(a - b) << endl;
	return 0;
}

C++: # include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template<class T>constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template<class T>constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char>T_char TL(T_char cX) { return tolower(cX); };
template <typename T_char>T_char TU(T_char cX) { return toupper(cX); };
typedef pair<LL, LL> pii;
const int vy[] = { -1, -1, -1, 0, 1, 1, 1, 0 }, vx[] = { -1, 0, 1, 1, 1, 0, -1, -1 };
const int dx[4] = { 0,1,0,-1 }, dy[4] = { 1,0,-1,0 };
int popcnt(unsigned long long n) { int cnt = 0; for (int i = 0; i < 64; i++)if ((n >> i) & 1)cnt++; return cnt; }
int d_sum(LL n) { int ret = 0; while (n > 0) { ret += n % 10; n /= 10; }return ret; }
int d_cnt(LL n) { int ret = 0; while (n > 0) { ret++; n /= 10; }return ret; }
LL gcd(LL a, LL b) { if (b == 0)return a; return gcd(b, a%b); };
LL lcm(LL a, LL b) { LL g = gcd(a, b); return a / g*b; };
# define ALL(qpqpq)           (qpqpq).begin(),(qpqpq).end()
# define UNIQUE(wpwpw)        sort(ALL((wpwpw)));(wpwpw).erase(unique(ALL((wpwpw))),(wpwpw).end())
# define LOWER(epepe)         transform(ALL((epepe)),(epepe).begin(),TL<char>)
# define UPPER(rprpr)         transform(ALL((rprpr)),(rprpr).begin(),TU<char>)
# define FOR(i,tptpt,ypypy)   for(LL i=(tptpt);i<(ypypy);i++)
# define REP(i,upupu)         FOR(i,0,upupu)
# define INIT                 std::ios::sync_with_stdio(false);std::cin.tie(0)

int a, b;

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

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

int main(){
    int x1,x2;
    cin>>x1>>x2;
    int ans;

    ans=x2-x1;
    if(ans <= 0) ans *= -1;

    cout<<ans<<endl;



    return 0;
}

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

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

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

using VS = vector<string>;    using LL = long long;
using VI = vector<int>;       using VVI = vector<VI>;
using PII = pair<int, int>;   using PLL = pair<LL, LL>;
using VL = vector<LL>;        using VVL = vector<VL>;

#define ALL(a)  begin((a)),end((a))
#define RALL(a) (a).rbegin(), (a).rend()
#define SZ(a) int((a).size())
#define SORT(c) sort(ALL((c)))
#define RSORT(c) sort(RALL((c)))
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))
#define FOR(i, s, e) for (int(i) = (s); (i) < (e); (i)++)
#define FORR(i, s, e) for (int(i) = (s); (i) > (e); (i)--)
//#pragma GCC optimize ("-O3") 
#ifdef YANG33
#include "mydebug.hpp"
#else
#define DEBUG(x) 
#endif
const int INF = 1e9;                          const LL LINF = 1e16;
const LL MOD = 1000000007;                    const double PI = acos(-1.0);
int DX[8] = { 0, 0, 1, -1, 1, 1, -1, -1 };    int DY[8] = { 1, -1, 0, 0, 1, -1, 1, -1 };

/* -----  2018/10/17  Problem: AOJ 0381 / Link: https://onlinejudge.u-aizu.ac.jp/challenges/search/volumes/0381  ----- */
/* ------問題------



-----問題ここまで----- */
/* -----解説等-----



----解説ここまで---- */

LL ans = 0LL;

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

	int a, b; cin >> a >> b;
	ans = abs(b - a);
	cout << ans << "\n";

	return 0;
}

C++: #include <cassert>

#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>

// C++
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
//#include <boost/foreach.hpp>
//#include <boost/range/algorithm.hpp>
#define rep(i,j,k) for(int i=(int)j;i<(int)k;i++)
#define ll long long
#define Sort(v) sort(all(v))
#define INF 1000000000
#define END return 0
#define pb push_back
#define se second
#define fi first
#define pb push_back
#define all(v) (v).begin() , (v).end()
#define MP make_pair
#define MOD 1000000007LL
using namespace std;
int day[12]={31,28,31,30,31,30,31,31,30,31,30,31};

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


/*
abcde

/root
a.txt
bunp.html
/desktop
r.txt
fsharp.cs
dp.cpp
/users
bison.txt

root r.txt
users r.txt
users a.txt

desktop/r.txt
../r.txt
../../a.txt
*/

C++: #include<iostream>
using namespace std;
int main(){
    int R,T,U;
    cin>>R>>U;
    if(R>U){
        T=R-U;
    }else{
        T=U-R;
    }
    cout<<T<<endl;
    return 0;
}