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 "bits/stdc++.h"

using namespace std;
using uint = unsigned int;
using int64 = long long;
using i64 = int64;
using uint64 = unsigned long long;
using vint = vector<int>;
using vint64 = vector<int64>;
template<typename T>
using p_que = priority_queue<T>;
#define rep(i,N) for(int i=0;i<(int)(N);++i)
#define rep1(i,N) for(int i=1;i<=(int)(N);++i)
#define fs first
#define sc second
#define eb emplace_back
#define all(x) x.begin(),x.end()

template<typename T>
vector<T> make_v(size_t a, T b) { return vector<T>(a, b); }
template<typename... Ts>
auto make_v(size_t a, Ts... ts) {
	return vector<decltype(make_v(ts...))>(a, make_v(ts...));
}

template<class T> ostream& operator<<(ostream& os, const vector<T>& v) {
	os << "[";
	for (auto& e : v) os << e << ", ";
	return os << "]";
}

template<class T, class U> ostream& operator<<(ostream& os, const pair<T, U> p) {
	return os << "P(" << p.first << ", " << p.second << ")";
}

template<class T, class U> ostream& operator<<(ostream& os, const map<T, U>& mp) {
	os << "{";
	for (auto& e : mp) os << e << " ";
	return os << "}";
}

void Main();
signed main() {
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	cout << fixed << setprecision(20);
	Main();
}

/* Cut from here! */

//#define int long long

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

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

#define ABS(X) ((X)<0?-(X):(X))

int main(void){
  int a,b;
  cin >> a >> b;
  cout << ABS(a-b) << 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{
        cout<<x1-x2<<endl;
    }
    
}

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<stdio.h>
int main(void) {
	int x, xx,a;
	scanf("%d", &x);
	scanf("%d", &xx);
	if (x > xx) {
		a = x - xx;
	}
	else if (x < xx) {
		a = xx - x;
	}
	else {
		a = x - xx;
	}
	printf("%d\n", a);
	return 0;
}

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

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

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

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

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

using namespace std;

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

C++: //↓template↓

#include "bits/stdc++.h"
using namespace std;
#define Would
#define you
#define all(n)  n.begin(),n.end()
#define rall(n) n.rbegin(),n.rend()
typedef long long ll;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
const double EPS = 1e-10;
const double pi = acos(-1);//3.1415926535897932384626433832795028...
const ll SIZE = 1 << 17;
int dx[] = { 1,0,-1,0 }, dy[] = { 0,1,0,-1 }, alp[30];
ll fac[200005], finv[200005], inv[200005];
vector<ll>dij;
struct edge { ll to, cost; };
vector<vector<edge> >G;

ll mod_pow(ll a, ll b) {
	ll res = 1, mul = a;
	for (int i = 0; i < 31; ++i) {
		if (b >> i & 1) {
			res *= mul;
			res %= MOD;
		}
		mul = (mul * mul) % MOD;
	}
	return res;
}

void addedge(int from, int to, int cost) {
	G[from].push_back({ to,cost });
	G[to].push_back({ from,cost });
}

template<typename T>
vector<T> make_v(size_t a) { return vector<T>(a); }

template<typename T, typename... Ts>
auto make_v(size_t a, Ts... ts) {
	return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}

template<typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type
fill_v(T & t, const V & v) { t = v; }

template<typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type
fill_v(T & t, const V & v) {
	for (auto& e : t) fill_v(e, v);
}

template<typename T>
void outp(vector<T>v) {
	for (int i = 0; i < v.size(); ++i) {
		cout << v[i];
		if (i != v.size() - 1) { cout << " "; }
	}
}

double add(double a, double b) {
	if (abs(a + b) < EPS * (abs(a) + abs(b))) { return 0; }
	return a + b;
}


//↑template↑


int main() {

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


}

C++: #include <iostream>
#include <stdio.h>
#include <math.h>
#include <algorithm>
#include <stdlib.h>
using namespace std;
int main(){
  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;
    if(a>b){
        cout << a-b;
    }
    else{
        cout << b-a;
    }
    cout << "\n";
    return 0;
}

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

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

    if(x1<x2){
        sum=x2-x1;
    }else if(x1>x2){
        sum=x1-x2;
    }else{
        sum=0;
    }

    cout << sum << '\n';
   

    return 0;


}

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

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

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

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

using namespace std;
using ll = long long;


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

C++: #include <iostream>

using namespace std;

int main(void)
{
	int A, B, K;

	cin >> A >> B;

	K = A - B;

	if (K < 0)
	{
		K = K * -1;
	}

	cout << K << endl;
}

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

 	int a , b , c ;
	cin >> a >> b ;
	c = a – b ;
	if (c < 0 ) cout << c * -1 <<endl ;
	cout << c << endl ;

return 0;
}

C++: #include "bits/stdc++.h"

#pragma warning(disable:4996)
using namespace std;
using ld = long double;



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

C++: //PCK2018予選問題2
#include "bits/stdc++.h"
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<cstdio>
#include<algorithm>
#include<functional>
using namespace std;
int main(void)
{
	int x1,x2,d;
	scanf("%d %d",&x1,&x2);
	d=x1-x2;
	if(d<0)	d=-d;
	printf("%d\n",d);
	return 0;
}

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;
}

C++: #include <iostream>
using namespace std;
int main(void){
    // Your code here!
    int a,b;
    cin>>a>>b;
    a=a-b;
    if(a<=0){a=a-a*2;}
    cout<<a<<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;
int main(void){
    int x1,x2;
    cin>>x1>>x2;
    if(x1>x2){
    cout<<x1-x2<<endl;
    }
    if(x1<x2){
    cout<<x2-x1<<endl;
    }
    if(x1==x2){
    cout<<x2-x1<<endl;
    }
}